An Equivalence Between Zero Knowledge and Commitments

DOI10.1007/978-3-540-78524-8_27zbMath1162.94395OpenAlexW1856987595MaRDI QIDQ5445522

Shien Jin Ong, Salil P. Vadhan

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_27

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

One-Way Functions and (Im)perfect Obfuscation ⋮ Statistical difference beyond the polarizing regime ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Zero-Knowledge Proofs of Proximity ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge ⋮ On the power of secure two-party computation ⋮ Unnamed Item ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ On the Power of Secure Two-Party Computation ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A language-dependent cryptographic primitive
• Bit commitment using pseudorandomness
• Statistical zero-knowledge languages can be recognized in two rounds
• Minimum disclosure proofs of knowledge
• How to construct constant-round zero-knowledge proof systems for NP
• On relationships between statistical zero-knowledge proofs
• Zero knowledge with efficient provers
• A complete problem for statistical zero knowledge
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• The complexity of promise problems with applications to public-key cryptography
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology - CRYPTO 2003
• A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
• Zero Knowledge and Soundness Are Symmetric
• Elements of Information Theory
• An Unconditional Study of Computational Zero Knowledge
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: An Equivalence Between Zero Knowledge and Commitments