A language-dependent cryptographic primitive

DOI10.1007/s001459900018zbMath0864.94018OpenAlexW2015654960MaRDI QIDQ676829

Hiroki Shuzuya, Yuji Ohta, Toshiya Itoh

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

zbMATH Keywords

zero-knowledge proofsbit commitmentsLanguage membership

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Constant-round adaptive zero-knowledge proofs for NP ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Zero-Knowledge Proofs of Proximity ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ On the power of secure two-party computation ⋮ On the Power of Secure Two-Party Computation

Cites Work

• Statistical zero-knowledge languages can be recognized in two rounds
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• Definitions and properties of zero-knowledge proof systems
• Computational complexity and knowledge complexity (extended abstract)
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Secure commitment against a powerful adversary
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A language-dependent cryptographic primitive