Practical client puzzles in the standard model

ASIACCS 2012 - 7th ACM Symposium on Information, Computer and Communications Security

Volumn , Issue , 2012, Pages 42-43

  Kuppusamy, Lakshmi ^a   Rangasamy, Jothi ^a   Stebila, Douglas ^a   Boyd, Colin ^a   Nieto, Juan González ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT PUZZLES; CRYPTOGRAPHIC PROBLEMS; DISCRETE LOGARITHMS; SOLUTION VERIFICATION; THE STANDARD MODEL;

CRYPTOGRAPHY; SECURITY OF DATA;

PROBLEM SOLVING;

EID: 84871952000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2414456.2414480     Document Type: Conference Paper

References (9)

1. A. Back. Hashcash- A denial of service counter-measure. URL: http://www.hashcash.org/papers/hashcash.pdf, 2002.
2. V. Boyko, M. Peinado, and R. Venkatesan. Speeding up discrete log and factoring based schemes via precomputations. In Advances in Cryptology -EUROCRYPT'98, volume 1403 of LNCS, pages 221-235. Springer, 1998.
3. L. Chen, P. Morrissey, N. Smart, and B. Warinschi. Security notions and generic constructions for client puzzles. In Advances in Cryptology - ASIACRYPT 2009, volume 5912 of LNCS, pages 505-523. Springer, 2009.
4. C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In Advances in Cryptology - Proceedings of CRYPTO '92, volume 740 of LNCS, pages 139-147. Springer, 1992.
5. A. Juels and J. G. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In NDSS 1999, pages 151-165. The Internet Society, 1999.
6. G. Karame and S. Capkun. Low-cost client puzzles based on modular exponentiation. In Computer Security - ESORICS 2010, volume 6345 of LNCS, pages 679-697. Springer, 2010.
7. J. Rangasamy, D. Stebila, L. Kuppusamy, C. Boyd, and J. M. G. Nieto. Efficient modular exponentiation-based puzzles for denial-of-service protection. In Proceedings of ICISC 2011.
8. D. Stebila, L. Kuppusamy, J. Rangasamy, C. Boyd, and J. M. G. Nieto. Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. In Topics in Cryptology - CT-RSA 2011, volume 6558 of LNCS, pages 284-301. Springer, 2011.
9. B. Waters, A. Juels, J. A. Halderman, and E. W. Felten. New client puzzle outsourcing techniques for DoS resistance. In ACM CCS, pages 246-256. ACM, 2004.