Practical client puzzles in the standard model

Authors:
Lakshmi Kuppusamy;Jothi Rangasamy;Douglas Stebila;Colin Boyd;Juan González Nieto
Affiliations:
Queensland University of Technology, Brisbane QLD, Australia;Queensland University of Technology, Brisbane QLD, Australia;Queensland University of Technology, Brisbane QLD, Australia;Queensland University of Technology, Brisbane QLD, Australia;Queensland University of Technology, Brisbane QLD, Australia
Venue:
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Year:
2012

Citing 6
Cited 1

Pricing via Processing or Combatting Junk Mail

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New client puzzle outsourcing techniques for DoS resistance

Proceedings of the 11th ACM conference on Computer and communications security
Security Notions and Generic Constructions for Client Puzzles

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Low-cost client puzzles based on modular exponentiation

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Efficient modular exponentiation-based puzzles for denial-of-service protection

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology

Recoverable encryption through a noised secret over a large cloud

Transactions on Large-Scale Data- and Knowledge-centered systems IX

Quantified Score

Hi-index	0.00

Visualization

Abstract

Client puzzles are cryptographic problems that are neither easy nor hard to solve. In this paper, we solve the problem of constructing cryptographic puzzles that are secure in the standard model and are very efficient. To prove the security of our puzzle, we introduce a new variant of the interval discrete logarithm assumption which may be of independent interest, and show this new problem to be hard under reasonable assumptions. Our experimental results show that, for 512-bit modulus, the solution verification time of our proposed puzzle can be up to 50x and 89x faster than that of the existing puzzles.