Back to Results
First PageMeta Content
Cryptographic protocols / Complexity classes / Probabilistic complexity theory / Zero-knowledge proof / Interactive proof system / IP / Quantum complexity theory / NP / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2007-01-18 15:34:42

Open Document

File Size: 6,55 MB

Share Result on Facebook

City

Cambridge / /

Company

Fiat / VieW / INTERACTIVE PROOF SYSTEMS / Let Lc / /

Country

Canada / /

Event

FDA Phase / /

Facility

University of Toronto / Massachusetts Institute of Technology / /

IndustryTerm

zero-knowledge protocols / cryptographic protocols / oblivious transfer protocol / secret exchanging protocol / probabilistic encryption algorithm / probabilistic polynomial time algorithms / arbitrary computing power / nondeterministic polynomial time algorithms / infinite computing power / zero-knowledge protocol / proof systems / above protocol / zero-knowledge proof systems / /

Organization

INTERACTIVE PROOF SYSTEMS party / University of Toronto / Toronto / National Science Foundation / Society for Industrial and Applied Mathematics Vol. / Laboratory for Computer Science / Massachusetts Institute of Technology / Natural Sciences and Engineering Research Council of Canada / L. That / Computer Science Department / /

Person

SILVIO MICALI / CHARLES RACKOFF / Goldreich / Wigderson / /

Position

author / Editor / judge / /

Product

GMW2 / Fischer / /

ProvinceOrState

Massachusetts / /

Technology

encryption / oblivious transfer protocol / cryptography / above protocol / nondeterministic polynomial time algorithms / possible encryptions / probabilistic polynomial time algorithms / probabilistic encryption algorithm / secret exchanging protocol / zero-knowledge protocol / zero-knowledge protocols / 195 protocol / above-mentioned protocol / /

SocialTag