February 2016

The system described in "Pinocchio: Nearly Practical Verifiable Computation" refines an important theoretical advance by Gennaro et al. Together, these two works represent a dramatic improvement in speed, generality, and functionality…

By encoding constraints of transformation correctness as terms in a cost function, and using a Markov Chain Monte Carlo sampler to explore the space of all possible code sequences, we are able to generate aggressively optimized…

To instill greater confidence in computations outsourced to the cloud, we introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions.