Lakshmi Kuppusamy
Douglas Stebila
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.
- A. Back. Hashcash- A denial of service counter-measure. URL:http://www.hashcash.org/papers/hashcash.pdf, 2002.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Practical client puzzles in the standard model
Recommendations
Practical certificateless public key encryption in the standard model
NSS'12: Proceedings of the 6th international conference on Network and System SecurityCertificateless public key cryptography was introduced to solve the key escrow problem in identity based cryptography without using public key certificates. In this paper, we investigate certificateless encryption (CLE) scheme whose security does not ...
A generic construction of useful client puzzles
ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications SecurityDenial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UCPs) which simultaneously decrease servers' burden and increase clients'. ...
Certificateless Signcryption in the Standard Model
Signcryption can realize encryption and signature simultaneously with lower computational costs and communicational overheads than those of the traditional sign-then-encrypt approach. Certificateless cryptosystem solves the key escrow problem in the ...
Comments