An Unconditional Study of Computational Zero Knowledge
From MaRDI portal
Publication:5757461
Recommendations
Cited in
(27)- General Properties of Quantum Zero-Knowledge Proofs
- The Complexity of Zero Knowledge
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Unconditionally secure commitments with quantum auxiliary inputs
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- Two Comments on Targeted Canonical Derandomizers
- Capturing one-way functions via NP-hardness of meta-complexity
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
- scientific article; zbMATH DE number 7204388 (Why is no real title available?)
- On nonadaptive reductions to the set of random strings and its dense subsets
- In a world of \(\mathrm{P}=\mathrm{BPP}\)
- Composition of zero-knowledge proofs with efficient provers
- Zero Knowledge and Soundness Are Symmetric
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
- SZK Proofs for Black-Box Group Problems
- Brief announcement: Zero-knowledge protocols for search problems
- Quantum commitments from complexity assumptions
- An Equivalence Between Zero Knowledge and Commitments
- From weak to strong zero-knowledge and applications
- Zero knowledge with efficient provers
- scientific article; zbMATH DE number 697825 (Why is no real title available?)
- A complete problem for statistical zero knowledge
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- Fidelity of quantum strategies with applications to cryptography
- Quantum commitments from complexity assumptions
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
This page was built for publication: An Unconditional Study of Computational Zero Knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757461)