Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm
From MaRDI portal
Publication:4933213
DOI10.1007/978-3-642-16280-0_6zbMath1286.94096OpenAlexW1573392376MaRDI QIDQ4933213
Publication date: 12 October 2010
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_6
zero knowledgegeneric constructiondesignated confirmer signaturesreduction/meta-reduction``signature of a commitment paradigm
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Undeniable Signatures
- Designated Confirmer Signatures Revisited
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- On Generic Constructions of Designated Confirmer Signatures
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
- Efficient Non-interactive Proof Systems for Bilinear Groups
- On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm