A language-dependent cryptographic primitive
From MaRDI portal
Publication:676829
DOI10.1007/S001459900018zbMATH Open0864.94018OpenAlexW2015654960MaRDI QIDQ676829FDOQ676829
Authors: Toshiya Itoh, Yűji Ohta, Hiroki Shuzuya 
Publication date: 23 March 1997
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900018
Recommendations
Cites Work
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Title not available (Why is that?)
- Minimum disclosure proofs of knowledge
- Title not available (Why is that?)
- Title not available (Why is that?)
- Does co-NP have short interactive proofs ?
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- Statistical zero-knowledge languages can be recognized in two rounds
- Title not available (Why is that?)
- Computational complexity and knowledge complexity (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure commitment against a powerful adversary
Cited In (9)
- An Equivalence Between Zero Knowledge and Commitments
- Zero-knowledge proofs of proximity
- On the Power of Secure Two-Party Computation
- Resettable statistical zero-knowledge for NP
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- On the power of secure two-party computation
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- 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)
