Back to Results
First PageMeta Content
Algebra / Verifiable computing / Function / XTR / Factorization of polynomials over a finite field and irreducibility tests / Abstract algebra / Mathematics / Polynomials


Pinocchio: Nearly Practical Verifiable Computation Bryan Parno Jon Howell Microsoft Research Craig Gentry
Add to Reading List

Document Date: 2014-03-06 18:09:31

Open Document

File Size: 454,08 KB

Share Result on Facebook

Company

IBM / VC / G1 / Intel / Microsoft / /

Event

Layoffs / FDA Phase / Reorganization / /

Facility

store P / /

IndustryTerm

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

Person

Pepper Ginger Pinocchio Time / Bryan Parno Jon Howell / Craig Gentry Mariana Raykova / /

Position

untrusted worker / programmer / /

Product

QAP solution / /

ProgrammingLanguage

C / Python / C++ / /

RadioStation

Core / /

Technology

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

SocialTag