Unifying Zero-Knowledge Proofs of Knowledge

DOI10.1007/978-3-642-02384-2_17zbMath1246.94033OpenAlexW19911921MaRDI QIDQ3637145

Ueli M. Maurer

Publication date: 7 July 2009

Published in: Progress in Cryptology – AFRICACRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02384-2_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Concurrent signatures from a variety of keys ⋮ Zero-knowledge proofs of knowledge for group homomorphisms ⋮ Privacy-preserving blueprints ⋮ Revisiting BBS signatures ⋮ Sherlock Holmes zero-knowledge protocols ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Efficient NIZKs for algebraic sets ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of identity
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA Generically Is Equivalent to Factoring

This page was built for publication: Unifying Zero-Knowledge Proofs of Knowledge