Unifying Zero-Knowledge Proofs of Knowledge

DOI10.1007/978-3-642-02384-2_17zbMath1246.94033MaRDI 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

94A60: Cryptography

Related Items

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, Minicrypt primitives with algebraic structure and applications, 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, Zero-knowledge proofs of knowledge for group homomorphisms, Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages, Concurrent signatures from a variety of keys, Cryptographic reverse firewalls for interactive proof systems, Improved OR-Composition of Sigma-Protocols, Efficiency Limitations for Σ-Protocols for Group Homomorphisms

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item