Pinocchio: Nearly Practical Verifiable Computation Bryan Parno Jon Howell Microsoft Research Craig Gentry

First Page		Document Content
Date: 2014-03-06 18:09:31 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 Source URL: research.microsoft.com Download Document from Source Website File Size: 454,08 KB Share Document on Facebook