Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring

DOI10.1016/j.tcs.2006.10.029zbMath1117.94009OpenAlexW2068920536MaRDI QIDQ868950

Rosario Gennaro, Dario Catalano

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.029

zbMATH Keywords

cryptographydigital signaturesfactoring

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient existentially unforgeable signature scheme and its applications
• Security arguments for digital signatures and blind signatures
• Digital signature schemes: general framework and fail-stop signatures
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• New Generation of Secure and Practical RSA-Based Signatures
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• How to sign given any trapdoor permutation
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004