An Equivalence Between Zero Knowledge and Commitments
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1304185
- Hybrid commitments and their applications to zero-knowledge proof systems
- Zero knowledge with efficient provers
- scientific article; zbMATH DE number 2009953
- scientific article; zbMATH DE number 4195166
- scientific article; zbMATH DE number 94166
- Zero-Knowledge Proofs
- Zero‐Knowledge Proofs
- Zero-knowledge proofs from secure multiparty computation
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
Cites work
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
- A complete problem for statistical zero knowledge
- A language-dependent cryptographic primitive
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - CRYPTO 2003
- An Unconditional Study of Computational Zero Knowledge
- Bit commitment using pseudorandomness
- Elements of Information Theory
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1024048 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 845842 (Why is no real title available?)
- scientific article; zbMATH DE number 1418312 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- On relationships between statistical zero-knowledge proofs
- On the Composition of Zero-Knowledge Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Statistical zero-knowledge languages can be recognized in two rounds
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Statistically-hiding commitment from any one-way function
- The complexity of promise problems with applications to public-key cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
- Zero Knowledge and Soundness Are Symmetric
- Zero knowledge with efficient provers
Cited in
(32)- Hybrid commitments and their applications to zero-knowledge proof systems
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Statistical difference beyond the polarizing regime
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the power of secure two-party computation
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- On the Power of Secure Two-Party Computation
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- Private coins versus public coins in zero-knowledge proof systems
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
- Which languages have 4-round zero-knowledge proofs?
- scientific article; zbMATH DE number 1304185 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 1406780 (Why is no real title available?)
- Zero-knowledge proofs of proximity
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- scientific article; zbMATH DE number 7250163 (Why is no real title available?)
- Structure versus hardness through the obfuscation lens
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
- On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems
- One-Way Functions and (Im)perfect Obfuscation
- On the formalisation of -protocols and commitment schemes
- General properties of quantum bit commitments (extended abstract)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer
- Strong batching for non-interactive statistical zero-knowledge
- Quantum advantage from one-way functions
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Doubly-efficient batch verification in statistical zero-knowledge
This page was built for publication: An Equivalence Between Zero Knowledge and Commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445522)
