A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
[chapter]
1995
Lecture Notes in Computer Science
This paper presents two transformations of public-coin/Arthur-Merlin proof systems which are zero-knowledge with respect to the honest verifier into (public-coin/Arthur-Merlin) proof systems which are zero-knowledge with tt3peCt to any verifier. The first transformation applies only to constant-round proof systems. It builds on Damgird's transformation (see Crypto93), using ordinary hashing functions instead of the interactive hashing protocol (of Naor, Ostrovsky, Venkatesan and Yungsee
doi:10.1007/3-540-44750-4_26
fatcat:im4kbasevffihmd27w7geb42jm