Reconstructing Hash Reversal based Proof of Work Schemes

LEET 2011 - 4th USENIX Workshop on Large-Scale Exploits and Emergent Threats: Botnets, spyware, Worms, and More

Volumn , Issue , 2011, Pages

  Green, Jeff ^a   Juen, Joshua ^a   Fatemieh, Omid ^a   Shankesi, Ravinder ^a   Jin, Dong ^a   Gunter, Carl A ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOTNET; COMPUTER VIRUSES; PROGRAM PROCESSORS;

CLIENT PUZZLES; COMPUTATIONAL CAPACITY; DEFENSE MECHANISM; GPU-BASED; PROOF OF WORK; SERVER LOADS;

DENIAL-OF-SERVICE ATTACK;

EID: 85084095139     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Bitcoin. http://www.bitcoin.org/.
2. Bloom Filter. http://en.wikipedia.org/wiki/Bloom filter.
3. Folding@Home. http://folding.stanford.edu/.
4. Nvidia Computational Chemistry. http://www.nvidia.com/object/computational chemistry.html.
5. Two root servers targeted by botnet. PC Advisor (pcadvisor.co.uk) (02/07/2007).
6. Phish fighters floored by DDoS assault. The Register (theregister.co.uk) (02/20/2007).
7. Surge in hijacked PC networks. BBC (bbc.co.uk) (03/19/2007).
8. ABADI, M., BURROWS, M., MANASSE, M., AND WOBBER, T. Moderately hard, memory-bound functions. ACM Trans. Inter. Tech. 5, 2 (2005), 299–327.
9. AURA, T., NIKANDER, P., AND LEIWO, J. Dos-resistant authentication with client puzzles. In 8th Inernational Workshop on Security Protocols (2000).
10. BACK, A. Hashcash - a denial of service counter-measure. Tech. rep., 2002.
11. BEVAND, M. Md5 chosen-prefix collisions on gpus. Black Hat USA (2009).
12. DEAN, D., AND STUBBLEFIELD, A. Using client puzzles to protect TLS. In Proceedings of the 10th USENIX Security Symposium (August 2001).
13. DWORK, C., GOLDBERG, A., AND NAOR, M. On memory-bound functions for fighting spam. CRYPTO (2003).
14. E. KAISER, W. F. mod kapow: Mitigating dos with transparent proof-of-work. In Proceedings of the 2007 ACM CoNEXT Conference (New York, New York, December 2007).
15. FENG, W., FENG, W., AND LUU, A. The design and implementation of network puzzles. In In Proc. Annual Joint Conf. of IEEE Computer and Communications Societies (INFOCOM) (2005), pp. 2372–2382.
16. FENG, W., KAISER, E., AND LUU, A. The design and implementation of network puzzles. In IEEE INFOCOM (March 2005).
17. FENG, W.-C., AND KAISER, E. The case for public work. In in Proceedings of Global Internet 2007 (May 2007).
18. INSTITUTE, I. S. The network simulator - ns-2.
19. JAKOBSON, M., AND JUELS, A. Proofs of work and bread pudding protocols. Communictions and Multimedia Security (1999), 258–272.
20. JUELS, A., AND BRAINARD, J. G. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the Network and Distributed System Security Symposium, NDSS 1999, San Diego, California, USA (1999).
21. KAISER, E., AND CHANG FENG, W. Helping ticketmaster: Changing the economics of ticket robots with geographic proof-of-work. In Global Internet (2010).
22. KANDULA, S., KATABI, D., JACOB, M., AND BERGER, A. W. Botz-4-Sale: Surviving Organized DDoS Attacks That Mimic Flash Crowds. In 2nd Symposium on Networked Systems Design and Implementation (NSDI) (Boston, MA, May 2005).
23. KHANNA, S., VENKATESH, S. S., FATEMIEH, O., KHAN, F., AND GUNTER, C. A. Adaptive selective verification. In INFOCOM ’08: IEEE Conference on Computer Communications (Phoenix, AZ, April 2008), IEEE.
24. LAURIE, B., AND CLAYTON, R.”proof-of-work” proves not to work. In WEAS 04 (2004).
25. LIU, D., AND CAMP, L. Proof of work can work. In Fifth Workshop on the Economics of Information Security (June 2006).
26. MANKINS, D., KRISHNAN, R., BOYD, C., ZAO, J., AND FRENTZ, M. Mitigating distributed denial of service attacks with dynamic resource pricing. In ACSAC’01: Proceedings of the 17th Annual Computer Security Applications Conference (Washington, DC, USA, 2001), IEEE Computer Society, p. 411.
27. PARNO, B., WENDLANDT, D., SHI, E., PERRIG, A., MAGGS, B., AND HU, Y.-C. Portcullis: protecting connection setup from denial-of-capability attacks. In SIGCOMM’07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications (New York, NY, USA, 2007), ACM, pp. 289–300.
28. RFC 3174 - US Secure Hash Algorithm 1 (SHA1). http://www.faqs.org/rfcs/rfc3174.html.
29. SHANKESI, R., FATEMIEH, O., AND GUNTER, C. A. Resource inflation threats to denial of service countermeasures. UIUC Tech. Report, http://hdl.handle.net/2142/17372, Oct. 2010.
30. WANG, X., AND REITER, M. K. Defending against denial-of-service attacks with puzzle auctions. In SP’03: Proceedings of the 2003 IEEE Symposium on Security and Privacy (Washington, DC, USA, 2003), IEEE Computer Society, p. 78.
31. WATERS, B., JUELS, A., HALDERMAN, J. A., AND FELTEN, E. New client puzzle outsourcing techniques for dos resistance. in Proceedings of Computer and Communications Security (2004).