Back to Results
First PageMeta Content
Computational complexity theory / IP / Proof of knowledge / Zero-knowledge proof / NP / Probabilistically checkable proof / Soundness / Formal verification / Snark / Theoretical computer science / Applied mathematics / Cryptographic protocols


Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT
Add to Reading List

Document Date: 2013-09-15 12:03:01

Open Document

File Size: 841,71 KB

Share Result on Facebook

City

Hadamard / /

Company

Lockheed-Martin Corporation / IBM / Xerox / Teradata / /

Country

United States / /

/

Event

FDA Phase / Person Travel / /

Facility

Boston University / University Alessandro Chiesa MIT Rafail Ostrovsky‡ UCLA Yuval Ishai† Technion Omer Paneth§ Boston University / Check Point Institute / /

IndustryTerm

decision algorithms / online complexity / decision algorithm / cryptographic tools / prover algorithm / probabilistic checking machinery / query algorithm / proof systems / argument systems / /

Organization

B. John Garrick Foundation / UCLA / Check Point Institute for Information Security / Defense Advanced Research Projects Agency / PCP QSPs / National Science Foundation / Department of Computer Science / MIT / U.S. Government / Tel Aviv University / Department of Mathematics / European Research Council / U.S. Office / Department of Defense / Boston University / Technion / /

Person

Omer Paneth / /

/

Position

author / extractor / SVP / /

Product

BCCT12 / FS87 / /

ProgrammingLanguage

RC / C / ML / /

Technology

encryption / decision algorithms / 42 B HVZK For LPCPs With Low-Degree Decision Algorithm / cryptography / additively homomorphic encryption / public key / Paillier encryption / prover algorithm / semantically-secure encryption / PCP-based protocol / query algorithm / Elgamal encryption / decision algorithm / evaluating the decision algorithm / /

SocialTag