A language-dependent cryptographic primitive
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 477971 (Why is no real title available?)
- scientific article; zbMATH DE number 512806 (Why is no real title available?)
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Computational complexity and knowledge complexity (extended abstract)
- Definitions and properties of zero-knowledge proof systems
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Secure commitment against a powerful adversary
- Statistical zero-knowledge languages can be recognized in two rounds
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(9)- Zero-knowledge proofs of proximity
- An Equivalence Between Zero Knowledge and Commitments
- On the Power of Secure Two-Party Computation
- Resettable statistical zero-knowledge for NP
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- On the power of secure two-party computation
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Constant-round adaptive zero-knowledge proofs for NP
This page was built for publication: A language-dependent cryptographic primitive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676829)
