Trading help for interaction in statistical zero-knowledge proofs

DOI10.1007/s00145-002-0113-0zbMath1029.94020OpenAlexW2044139112MaRDI QIDQ1402366

Michael Ben-Or, Dan Gutfreund

Publication date: 27 August 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-002-0113-0

zbMATH Keywords

relative entropyKullback-Leibler distancecomplexity classespromise problemsGraph isomorphismNon-interactive zero-knowledgeZero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Zero knowledge and circuit minimization ⋮ Statistical difference beyond the polarizing regime ⋮ The Complexity of Zero Knowledge ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

This page was built for publication: Trading help for interaction in statistical zero-knowledge proofs