How to sign given any trapdoor permutation

DOI10.1145/147508.147537MaRDI QIDQ4302825zbMATH OpenOpenAlexFDO

Authors M. Bellare, Silvio Micali

Publication date 21 August 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/147508.147537

zbMATH Keywords

cryptographydigital signaturesrandomnesstrapdoor functions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4179279
• Public Key Cryptography - PKC 2005
• Advances in Cryptology - EUROCRYPT 2004
• Constructing parallel long-message signcryption scheme from trapdoor permutation
• Trapdoor sanitizable signatures made easy
• A unified framework for trapdoor-permutation-based sequential aggregate signatures
• Certifying trapdoor permutations, revisited
• Hiding information and signatures in trapdoor knapsacks
• Approximate trapdoors for lattices and smaller hash-and-sign signatures

Cited in

(10)

• Reducing complexity assumptions for statistically-hiding commitment
• How to sign digital streams
• Constructing parallel long-message signcryption scheme from trapdoor permutation
• scientific article; zbMATH DE number 4179279 (Why is no real title available?)
• scientific article; zbMATH DE number 3887597 (Why is no real title available?)
• scientific article; zbMATH DE number 1341878 (Why is no real title available?)
• Public Key Cryptography - PKC 2005
• Generic security-amplifying methods of ordinary digital signatures
• Short signatures from DDH without pairings or random oracles
• Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring

This page was built for publication: How to sign given any trapdoor permutation

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