On the Composition of Public-Coin Zero-Knowledge Protocols

DOI10.1137/100811465zbMath1235.68077OpenAlexW3021547345MaRDI QIDQ5895542

Wei-Lung Dustin Tseng, Douglas Wikström, Rafael Pass

Publication date: 15 March 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100811465

zbMATH Keywords

zero-knowledgeparallel repetitionpublic-coin interactive protocols

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Post-quantum resettably-sound zero knowledge ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ On the Existence of Extractable One-Way Functions

This page was built for publication: On the Composition of Public-Coin Zero-Knowledge Protocols