Back to Results
First PageMeta Content
Algebra / Verifiable computing / NP / IP / Boolean algebra / Abstract algebra / Polynomials / Mathematics


2013 IEEE Symposium on Security and Privacy Pinocchio: Nearly Practical Verifiable Computation Bryan Parno Jon Howell Microsoft Research
Add to Reading List

Document Date: 2013-04-05 19:56:30


Open Document

File Size: 531,11 KB

Share Result on Facebook

Company

IBM / VC / G1 / Intel / Microsoft / /

Currency

USD / /

Event

Layoffs / Product Recall / Product Issues / FDA Phase / Reorganization / /

Facility

store P / Building VC / /

IndustryTerm

real applications / volunteer distributed computing / randomized key generation algorithm / machinery / secure hardware / zero-knowledge applications / native hardware / actual protocol / Considerable systems / polynomial algorithms / elliptic curve / cellphone carrier / polynomial-time algorithms / graph algorithm / deterministic verification algorithm / generalpurpose protocols / verifiable computation protocol / grid computing / verifiable computing / lattice gas sim / bilinear / computing / larger protocol / polynomial interpolation algorithm / cryptographic protocol / lattice-gas scientific simulator / deterministic worker algorithm / /

Person

Bryan Parno Jon Howell / Craig Gentry Mariana Raykova / /

Position

untrusted worker / programmer / /

Product

Figure / QAP / /

ProgrammingLanguage

C / Python / C++ / /

RadioStation

Core / /

Technology

optimizing polynomial algorithms / RAM / actual protocol / three polynomial-time algorithms / cryptographic protocol / SDH / polynomial algorithms / generalpurpose protocols / mobile devices / encryption / base protocol / deterministic verification algorithm / larger protocol / public key / deterministic worker algorithm / graph algorithm / improved protocol / PDH / caching / verifiable computation protocol / polynomial interpolation algorithm / recombination / randomized key generation algorithm / /

SocialTag