On the Composition of Zero-Knowledge Proof Systems
From MaRDI portal
Publication:4875450
DOI10.1137/S0097539791220688zbMath0841.68112MaRDI QIDQ4875450
Publication date: 2 July 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
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, The Complexity of Zero Knowledge, Existence of 3-round zero-knowledge proof systems for NP, Lower bounds for non-black-box zero knowledge, Parallel and Concurrent Security of the HB and HB + Protocols, The Knowledge Complexity of Interactive Proof Systems