Back to Results
First PageMeta Content
Cryptographic protocols / Zero-knowledge proof / Proof of knowledge / Non-interactive zero-knowledge proof / IP / ZK / Snark / NP / Mathematical proof / Theoretical computer science / Graph theory / Cryptography


Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture Eli Ben-Sasson Alessandro Chiesa
Add to Reading List

Document Date: 2015-05-09 17:46:15


Open Document

File Size: 1,41 MB

Share Result on Facebook

Company

GT / Elite Pharmaceuticals Inc. / /

Currency

pence / /

Event

FDA Phase / /

Facility

University MIT May / /

IndustryTerm

computationally-weak device / security applications / polynomial-time algorithms / prior systems / use several sub-algorithms / cyclic / web browsers / Generic sub-algorithms / zero-knowledge proof systems / /

Organization

Technion MIT / Harvard / Tel Aviv University MIT / /

Person

Eli Ben-Sasson Alessandro / Ai / Eran Tromer Madars Virza Technion / Ben-Sasson Alessandro Chiesa Eran Tromer Madars / Bryan Parno / /

Position

general data dependencies / programmer / /

Product

Sco05 / Parno / PGHR13 / /

ProgrammingLanguage

RC / C / Python / JavaScript / /

Technology

zk-SNARK protocol / pairing-based protocols / two polynomial-time algorithms / Cryptography / QAP-based zk-SNARK protocol / polynomial-time algorithms / Generic sub-algorithms / 4.1 The PGHR protocol / smartphone / /

SocialTag