Improved Cryptographic Puzzle Based on Modular Exponentiation

DOI10.1007/978-81-322-2452-5_8zbMath1323.94124OpenAlexW1417201919MaRDI QIDQ3449412

Jothi Rangasamy, Lakshmi Kuppusamy

Publication date: 4 November 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2452-5_8

zbMATH Keywords

unforgeabilityproof-of-workdifficultycryptographic puzzledenial-f-service protection

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.
• On the uniformity of distribution of the RSA pairs
• Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
• Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection
• Security Notions and Generic Constructions for Client Puzzles
• Stateless connections
• Theory of Cryptography
• Theory of Cryptography
• Selecting cryptographic key sizes

This page was built for publication: Improved Cryptographic Puzzle Based on Modular Exponentiation