Back to Results
First PageMeta Content
Cryptographic protocols / Complexity classes / Zero-knowledge proof / Interactive proof system / Commitment scheme / NP / IP / Soundness / Entropy / Theoretical computer science / Cryptography / Applied mathematics


Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model∗ Andr´e Chailloux† Dragos Florin Ciocan‡
Add to Reading List

Document Date: 2007-12-13 07:18:22


Open Document

File Size: 360,98 KB

Share Result on Facebook

City

Cambridge / Paris / /

Company

Previous Work / /

/

Facility

Miller Institute / Harvard University / /

IndustryTerm

classical interactive protocols / zero-knowledge protocols / cryptographic protocols / statistical zero-knowledge proof systems / cryptographic applications / probabilistic polynomial-time algorithm / interactive proof systems / probabilistic polynomial time algorithms / probabilistic polynomial-time dealer algorithm / tensor product / polynomial-time algorithm / proof systems / argument systems / noninteractive statistical zero-knowledge proof systems / zero-knowledge proof systems / /

Organization

School of Engineering and Applied Sciences / Harvard University / National Science Foundation / European Commission / French Ministry / Miller Institute for Basic Research / /

Person

Ben-Or / /

Position

help model / probabilistic polynomial-time dealer / trusted dealer / Cio / classical model for proof systems / dealer / second author / /

ProvinceOrState

Massachusetts / /

PublishedMedium

the Cryptology ePrint Archive / /

Technology

cryptography / probabilistic polynomial time algorithms / polynomial-time algorithm / classical interactive protocols / zero-knowledge protocols / probabilistic polynomial-time algorithm / simulation / specified protocol / two-stage interactive protocol / nonuniform PPT algorithm / interactive protocol / probabilistic polynomial-time dealer algorithm / /

SocialTag