Abstract
This paper shows that using direct properties of a zero-knowledge protocol itself, one may impose a 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 statistical 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). Three basic questions regarding statistical zero-knowledge (SZK) are solved in this model: If L has a honest-verifier SZK proof then L has an any-verifier nonuniform simulation SZK proof. If L has an SZK proof then L has an non-uniform simulation SZK proof. If L has a private-coin SZK proof then L has a public-coin nonuniform simulation SZK proof. KeywordsProof SystemRandom StringCommitment SchemeCommon InputCheat BehaviorThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
