Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs

DOI10.1007/11593447_36zbMATH Open1154.94454OpenAlexW1595597526MaRDI QIDQ5451096FDOQ5451096

Authors: Craig Gentry, David Molnar, Zulfikar Ramzan 

Publication date: 18 March 2008

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

Full work available at URL: https://doi.org/10.1007/11593447_36

Recommendations

• Designated Confirmer Signatures Revisited
• Theory of Cryptography
• Efficient confirmer signatures from the ``signature of a commitment paradigm
• On Generic Constructions of Designated Confirmer Signatures
• On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (14)

• Title not available (Why is that?)
• The construction of ambiguous optimistic fair exchange from designated confirmer signature without random oracles
• The Construction of Ambiguous Optimistic Fair Exchange from Designated Confirmer Signature without Random Oracles
• Designated verifier proofs and their applications
• A reduction of security notions in designated confirmer signatures
• Information Security
• Theory of Cryptography
• Designated Confirmer Signatures Revisited
• On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures
• On-line non-transferable signatures revisited
• Designated confirmer signatures with unified verification
• Online-Untransferable Signatures
• Efficient confirmer signatures from the ``signature of a commitment paradigm
• Non-interactive confirmer signatures

This page was built for publication: Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs

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