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

DOI10.1016/J.TCS.2006.10.029zbMATH Open1117.94009OpenAlexW2068920536MaRDI QIDQ868950FDOQ868950

Authors: Dario Catalano, Rosario Gennaro 

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

Recommendations

• Public Key Cryptography - PKC 2005
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• scientific article; zbMATH DE number 1440056
• Tightly-secure signatures from the decisional composite residuosity assumption
• scientific article; zbMATH DE number 708796

zbMATH Keywords

cryptographydigital signaturesfactoring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Public Key Cryptography - PKC 2005
• On blockwise symmetric matchgate signatures and higher domain \#CSP
• Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice

This page was built for publication: Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868950)