Back to Results
First PageMeta Content
Probabilistic complexity theory / IP / Probabilistically checkable proof / NP / Vector space / Soundness / MAX-3SAT / Algebra / Mathematics / Theoretical computer science


Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at
Add to Reading List

Document Date: 2013-03-10 19:40:43


Open Document

File Size: 490,90 KB

Share Result on Facebook

City

Austin / Prague / /

Company

GPU / Lb Lc / Microsoft / NVIDIA / /

Country

Czech Republic / /

Currency

USD / /

Event

FDA Phase / /

Facility

University of Texas / GMP library / /

/

IndustryTerm

equivalent interactive protocol / linear commitment protocol / secure systems / commitment protocol / machinery / outer product / verification protocol / constructed protocols / argument systems / remote server / outer products / verified computation protocols / level solution / randomized verification algorithm / naive applications / computing / cloud computing / cryptographic machinery / scientific computing / verification machinery / /

Organization

University of Texas at Austin / /

Person

Benjamin Braun / Michael Walfish / Ginger Figure / Ai / Zaatar / Andrew J. Blumberg / V. Then / V / Ginger Ginger Ginger / Bryan Parno / Victor Vu / /

Position

model / general systems questions / cost model of Ginger / /

Product

Quadro FX 5800 GPUs / ElGamal / these / V1 / /

ProgrammingLanguage

Java / Python / C++ / /

ProvinceOrState

Texas / /

Technology

RAM / Xeon processor / hand-tailored protocols / commitment protocol / The protocol / verified computation protocols / Ginger protocol / equivalent interactive protocol / Zaatar protocol / linear commitment protocol / encryption / cryptography / Java / IKO protocol / verification protocol / PCP protocol / randomized verification algorithm / manually constructed protocols / stream cipher / /

SocialTag