How to construct constant-round zero-knowledge proof systems for NP
From MaRDI portal
Publication:1924196
zbMath0855.68085MaRDI QIDQ1924196
Publication date: 14 October 1996
Published in: Journal of Cryptology (Search for Journal in Brave)
94A60: Cryptography
Related Items
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, An Equivalence Between Zero Knowledge and Commitments, The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization, Efficient Fully-Simulatable Oblivious Transfer, New efficient and secure protocols for verifiable signature sharing and other applications, Lower bounds and impossibility results for concurrent self composition, Existence of 3-round zero-knowledge proof systems for NP, Lower bounds for non-black-box zero knowledge, Fully-Simulatable Oblivious Set Transfer, One-Time Programs, The Knowledge Complexity of Interactive Proof Systems