Toward non-parallelizable client puzzles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4856 LNCS, Issue , 2007, Pages 247-264

  Tritilanunt, Suratose ^a   Boyd, Colin ^a   Foo, Ernest ^a   Nieto, Juan Manuel González ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Client puzzles; Denial of service attacks; Non parallelizable cryptographic puzzles

Indexed keywords

COMPUTER CRIME; NETWORK PROTOCOLS; PROBLEM SOLVING;

CLIENT PUZZLES; DENIAL OF SERVICE ATTACKS;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 38349080863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76969-9_16     Document Type: Conference Paper

References (25)

1. Adleman, L M.: On Breaking Generalized Knapsack Public Key Cryptosystems. In: the 15th Annual ACM Symposium on Theory of Computing, pp. 402-412 (1983)
2. Aura, T., Nikander, P., Leiwo, J.: DoS-resistant authentication with client puzzles. In: Security Protocols Workshop 2000, Cambridge, pp. 170-181 (April 2000)
3. Backes, W., Wetzel, S.: Heuristics on Lattice Basis Reduction in Practice. Journal of Experimental Algorithmics (JEA) 7, 1-21 (2002)
4. Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C., Stern, J.: Improved low-density subset sum algorithms. Computational Complexity 2(2), 111-128 (1992)
5. Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139-147. Springer, Heidelberg (1992)
6. Feng, W., Kaiser, E., Feng, W., Luu, A.: The Design and Implementation of Network Layer Puzzles. In: Proceedings of IEEE Infocom 2005 (March 13-17, 2005)
7. Feng, W., Luu, A., Feng, W.: Scalable, Fine-grained Control of Network Puzzles. Technical report 03-015, OGI CSE (2003)
8. Gao, Y.: Efficient Trapdoor-Based Client Puzzle System against DoS Attacks. In: Master of Computer Science by Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia (2005)
9. Groza, B., Petrica, D.: On Chained Cryptographic Puzzles. In: 3rd Romanian-Hungarian Joint Symposium on Applied Computational Intelligence (SACI), Timisoara, Romania, pp. 25-26 (May 2006)
10. Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In: NDSS 1999. The 1999 Network and Distributed System Security Symposium, San Diego, California, USA, pp. 151-165. Internet Society Press, Reston (1999)
11. Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM (JACM) 32(1), 229-246 (1985)
12. LaMacchia, B.A.: Basis Reduction Algorithms and Subset Sum Problems. Master Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1991)
13. Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen 261(4), 515-534 (1982)
14. Ma, M.: Mitigating denial of service attacks with password puzzles. In: ITCC 2005. International Conference on Information Technology: Coding and Computing, 2nd edn., pp. 621-626 (2005)
15. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Inc., Chichester (1990)
16. Moskowitz, R.: The Host Identity Protocol (HIP). Internet Draft, Internet Engineering Task Force (October 2007), http://www.ietf.org/internet-drafts/ draft-ietf-hip-base-09.txt
17. Price, G.: A General Attack Model on Hash-Based Client Puzzles. In: 9th IMA International Conference on Cryptography and Coding, Cirencester, UK, pp. 16-18. Springer, Heidelberg (2003)
18. 3 algorithm. Journal of Combinatorial Mathematics and Combinatorial Computing 3, 49-63 (1988)
19. Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock Puzzles and Timed-release Crypto. Technical Report TR-684, Massachusetts Institute of Technology, Cambridge, MA, USA (March 10, 1996)
20. Schnorr, C.P.: Fast LLL-type Lattice Reduction. Information and Computation 204(1), 1-25 (2006)
21. Schnorr, C.P., Euchner, M.: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 68-85. Springer, Heidelberg (1991)
22. Smart, N.: Cryptography: An Introduction, 2nd edn. McGraw-Hill, New York (2006)
23. Villard, G.: Parallel Lattice Basis Reduction. In: ISSAC 1992. The International Symposium on Symbolic and Algebraic Computation, pp. 269-277. ACM Press, New York (1992)
24. Wang, X., Reiter, M.K.: Defending Against Denial-of-Service Attacks with Puzzle Auctions (Extended Abstract). In: SP 2003. The 2003 IEEE Symposium on Security and Privacy, Berkeley, CA, USA, pp. 78-92 (May 11-13, 2003)
25. Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New Client Puzzle Outsourcing Techniques for DoS Resistance. In: CCS 2004. The 11th ACM Conference on Computer and Communications Security, pp. 246-256. ACM Press, Washington DC (2004)