Unifying Zero-Knowledge Proofs of Knowledge

DOI10.1007/978-3-642-02384-2_17MaRDI QIDQ3637145zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Zero-knowledge proofs of knowledge for group homomorphisms
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Zero-knowledge proofs of identity
• scientific article; zbMATH DE number 1440055
• Information Security and Cryptology

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA Generically Is Equivalent to Factoring
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 708798 (Why is no real title available?)
• scientific article; zbMATH DE number 1162684 (Why is no real title available?)
• New directions in cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Zero-knowledge proofs of identity

Cited in

(36)

• Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
• Zero-knowledge argument for simultaneous discrete logarithms
• 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
• Strengthening zero-knowledge protocols using signatures
• Generalized proofs of knowledge with fully dynamic setup
• Improved OR-composition of sigma-protocols
• A zero-knowledge proof based remote desktop authentication protocol
• Automatic generation of -protocols
• A framework for practical universally composable zero-knowledge protocols
• scientific article; zbMATH DE number 4211486 (Why is no real title available?)
• Efficiency limitations for -protocols for group homomorphisms
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Zero-knowledge argument for simultaneous discrete logarithms
• On the Portability of Generalized Schnorr Proofs
• Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 2009955 (Why is no real title available?)
• scientific article; zbMATH DE number 883898 (Why is no real title available?)
• 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
• On sigma-protocols and (packed) black-box secret sharing schemes
• Certifying private probabilistic mechanisms
• Cryptographic reverse firewalls for interactive proof systems
• Sherlock Holmes zero-knowledge protocols secure against active attackers
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• Updatable privacy-preserving blueprints
• Robust non-interactive zero-knowledge combiners
• Zero-knowledge proofs of knowledge for group homomorphisms

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

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