Keeping the SZK-verifier honest unconditionally

DOI10.1007/BFB0052226MaRDI QIDQ4364541zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung

Publication date 10 February 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0052226

zbMATH Keywords

simulationstatistical zero-knowledge proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

This paper shows that using direct properties of a zero-knowledge protocol itself, one may impose an honest behavior on the verifier (without additional cryptographic tools). The main technical contribution is showing that if a language \(L\) has an Arthur-Merlin (i.e. public coins) honest-verifier SZK proof system then \(L\) has an (any-verifier) SZK proof system when we use a non-uniform simulation model of SZK (where the simulation view and protocol view can be made statistically closer than any given polynomial given as a parameter). For the entire collection see [Zbl 0870.00047].

Recommendations

• scientific article; zbMATH DE number 1775425
• Honest verifier vs dishonest verifier in public coin zero-knowledge proofs
• Interactive Proofs with Provable Security against Honest Verifiers
• On relationships between statistical zero-knowledge proofs
• Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

Cited in

(2)

• An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
• Honest verifier vs dishonest verifier in public coin zero-knowledge proofs

This page was built for publication: Keeping the SZK-verifier honest unconditionally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364541)