Security notions and generic constructions for client puzzles

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

Volumn 5912 LNCS, Issue , 2009, Pages 505-523

  Chen, Liqun ^a   Morrissey, Paul ^b   Smart, Nigel P ^b   Warinschi, Bogdan ^b  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT PUZZLES; COMPUTATIONAL PROBLEM; DENIAL OF SERVICE ATTACKS; DOS ATTACKS; FORMAL MODEL; GENERIC CONSTRUCTION; SECURITY DEFINITIONS; SECURITY NOTION;

COMPUTER CRIME; CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 72449146821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_30     Document Type: Conference Paper

References (28)

1. Aiello, W., Bellovin, S.M., Blaze, M., Canetti, R., Ioannidis, J., Kermoytis, A.D., Reingold, O.: Just Fast Keying: Key Agreement In A Hostile Internet. ACM Trans. on Info. and Syst. Sec. 4, 1-30 (2004)
2. Aura, T., Nikander, P., Leiwo, J.: DoS-Resistant Authentication with Client Puzzles. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol. 2133, pp. 170-181. Springer, Heidelberg (2001)
3. Barak, B., Mahmoody-Ghidary, M.: Merkle Puzzles are Optimal. Cryptology ePrint archive, report 2008/032 (2008)
4. Biham, E., Goren, Y.J., Ishai, Y.: Basing Weak Public-Key Cryptoraphy on Strong One-Way Functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 55-72. Springer, Heidelberg (2008)
5. Canetti, R., Halevi, S., Steiner, M.: Hardness Amplification of Weakly Verifiable Puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 17-33. Springer, Heidelberg (2005)
6. Chen, L., Mao, W.: An Auditable Metering Scheme for Web Advertisement Applications. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 475-485. Springer, Heidelberg (2001)
7. Douligeris, C., Mitrokotsa, A.: DDoS Attacks and Defence mechanisms: Classification and State-of-the-Art. Computer Networks 44, 643-666 (2004)
8. Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Email. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139-147. Springer, Heidelberg (1993)
9. Eddy, W.: TCP SYN Flooding Attacks and Common Mitigations. RFC 4987
10. Gao, Y.: Efficient Trapdoor-Based Client Puzzle System Against DoS Attacks. M.Sc Thesis, University of Wollongong, Computer Science Department (2005)
11. Groza, B., Petrica, D.: On Chained Cryptographic Puzzles. In: 3rd Romanian-Hungarian Joint Symp. on Applied Comput. Intel. - SACI, pp. 25-26 (2006)
12. Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-Way Permutations. In: ACM Symp. on the Theory of Comp. - STOC 1989, pp. 44-61 (1989)
13. Jakobsson, M., Juels, A.: Proofs of Work and Bread Pudding Protocols. In: Joint Working Conference on Secure Information Networks: Communications and Multimedia Security. IFIP Conference Proceedings, vol. 152, pp. 258-272 (1999)
14. Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. In: ISOC Network and Distributed System Security Symposium, pp. 151-165 (1999)
15. Karig, D., Lee, R.: Remote Denial of Service Attacks and Countermeasures. Princeton University Department of Electrical Engineering Technical Report CE-L2001-002 (2001)
16. Meadows, C.: A Formal Framework and Evaluation Method for Network Denial of Service. In: 12th Computer Security Foundations Workshop, pp. 4-13. IEEE Computer Society Press, Los Alamitos (1999)
17. Meadows, C.: A Cost-Based Framework for Analysis of Denial of Service in Networks. Journal of Computer Security 9, 143-164 (2001)
18. Merkle, R.: Secure Communications Over Insecure Channels. Communications of the ACM 21, 294-299 (1978)
19. Mirkovic, J., Martin, J., Reiher, P.: A Taxonomy of DDoS Attack and DDoS Defense Mechanisms. ACM SIGCOMM Computer Communication Review 34, 39-53 (2004)
20. Moskowitz, R., Nikander, P., Jokela, P., Henderson, T.: Host Identity Protocol. Internet Draft (October 2007)
21. Price, G.: A General Attack Model of Hash-Based Client Puzzles. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 319-331. Springer, Heidelberg (2003)
22. Rivest, R.L., Shamir, A.,Wagner, D.: Time-lock Puzzles and Timed-release Crypto. Massachusetts Institute of Technology Technical Report TR-684 (1996)
23. Rogaway, P.: Formalizing Human Ignorance. In: Nguyên, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 211-228. Springer, Heidelberg (2006)
24. Schaller, P., Capkun, S., Basin, D.: BAP: Broadcast Authentication Using Cryptographic Puzzles. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 401-419. Springer, Heidelberg (2007)
25. Smith, J., González-Nieto, J.M., Boyd, C.: Modelling Denial of Service Attacks on JFK with Meadows's Cost-Based Framework. In: Proceedings of the 2006 Australasian workshop on Grid computing and e-research, vol. 54, pp. 125-134 (2006)
26. Specht, S., Lee, R.: Distributed Denial of Service: Taxonomies of Attacks, Tools, and Countermeasures. In: 17th International Conference on Parallel and Distributed Computing Systems, pp. 543-550 (2004)
27. Tritilanunt, S., Boyd, C., Foo, E., González Nieto, J.M.: Toward Non-parallelizable Client Puzzles. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol. 4856, pp. 247-264. Springer, Heidelberg (2007)
28. Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New Client Puzzle Outsourcing Techniques for DoS Resistance. In: 11th ACM Conference on Computer and Communication Security - CCS, pp. 246-256. ACM Press, New York (2004)