Back to Results
First PageMeta Content
Cryptographic protocols / Complexity classes / Interactive proof system / Zero-knowledge proof / Proof of knowledge / Quantum complexity theory / IP / NP / Soundness / Theoretical computer science / Computational complexity theory / Cryptography


Composition of Zero-Knowledge Proofs with Efficient Provers∗ Eleanor Birrell† Salil Vadhan‡
Add to Reading List

Document Date: 2009-12-07 14:26:58


Open Document

File Size: 247,63 KB

Share Result on Facebook

City

Cambridge / Ithaca / /

Currency

pence / /

/

Facility

Cornell University / Harvard University / /

IndustryTerm

uniform probabilistic polynomial-time algorithms / cryptographic applications / probabilistic polynomial-time algorithm / interactive-proof protocol / secure key agreement protocol / analogous protocol / zero-knowledge protocol / agreement protocol / polynomialtime algorithm / zero-knowledge proof systems / /

Organization

School of Engineering and Applied Sciences / Center for Research / Harvard University / National Science Foundation / Department of Computer Science / Cornell University / /

Person

Eleanor Birrell† Salil Vadhan / Shamir / /

Position

first author / /

ProgrammingLanguage

L / R / K / /

ProvinceOrState

New York / Massachusetts / /

Technology

Goldreich-Krawczyk protocol / interactive-proof protocol / defined protocol / Krawczyk protocol / key agreement protocol / zero-knowledge protocol / secure key agreement protocol / uniform probabilistic polynomial-time algorithms / probabilistic polynomial-time algorithm / polynomialtime algorithm / simulation / analogous protocol / interactive protocol / /

URL

http /

SocialTag