Secure signature schemes based on interactive protocols

DOI10.1007/3-540-44750-4_24MaRDI QIDQ4343443zbMATH OpenFDO

Authors Ronald Cramer, Ivan B. Damgård

Publication date 1 December 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_24

zbMATH Keywords

one-way group homomorphismssignature schemetrapdoor permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• scientific article; zbMATH DE number 708798
• scientific article; zbMATH DE number 176568
• scientific article; zbMATH DE number 2009970
• scientific article; zbMATH DE number 708796

Cited in

(13)

• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• On the tightness of forward-secure signature reductions
• Confined guessing: new signatures from standard assumptions
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
• Fine-grained forward-secure signature schemes without random oracles
• A secure and efficient proof of integer in an interval range
• Reactively secure signature schemes
• New generation of secure and practical RSA-based signatures
• Unlinkable Randomizable Signature and Its Application in Group Signature
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• Interactive Bi-Proof Systems and Undeniable Signature Schemes
• Generic security-amplifying methods of ordinary digital signatures
• Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring

This page was built for publication: Secure signature schemes based on interactive protocols

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