Geppetto: Versatile Verifiable Computation

作者: Craig Costello , Cedric Fournet , Jon Howell , Markulf Kohlweiss , Benjamin Kreuter

DOI: 10.1109/SP.2015.23

关键词: CryptographyParallel computingMathematical proofComputationCompilerVerifiable computingComputer scienceCryptographic primitiveBounded functionCorrectnessCryptographic protocolCloud computing

摘要: Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak client to securely outsource computations remote parties. Recent work has dramatically reduced the client's cost verify correctness of their results, but overhead produce proofs remains largely impractical. Geppetto introduces complementary techniques for reducing prover and increasing flexibility. With Multi QAPs, reduces sharing state between (e.g., For MapReduce) or within single computation by up two orders magnitude. Via careful choice cryptographic primitives, Geppetto's instantiation bounded proof bootstrapping improves on prior bootstrapped systems five magnitude, albeit at some universality. also efficiently verifies correct execution proprietary (i.e., Secret) algorithms. Finally, use energy-saving circuits brings prover's costs more line with program's actual (rather than worst-case) time. is implemented full-fledged, scalable compiler runtime that consume LLVM code generated from variety source C programs libraries.

参考文章(54)
Rosario Gennaro, Craig Gentry, Bryan Parno, Mariana Raykova, Quadratic Span Programs and Succinct NIZKs without PCPs theory and application of cryptographic techniques. pp. 626- 645 ,(2013) , 10.1007/978-3-642-38348-9_37
Alex Escala, Jens Groth, Fine-Tuning Groth-Sahai Proofs public key cryptography. ,vol. 8383, pp. 630- 649 ,(2014) , 10.1007/978-3-642-54631-0_36
Bryan Parno, Adrian Perrig, Jonathan M. McCune, Bootstrapping Trust in Modern Computers ,(2011)
Eli Ben-Sasson, Eran Tromer, Alessandro Chiesa, Madars Virza, Succinct non-interactive zero knowledge for a von Neumann architecture usenix security symposium. pp. 781- 796 ,(2014)
Philippe Golle, Ilya Mironov, Uncheatable Distributed Computations the cryptographers track at the rsa conference. ,vol. 2020, pp. 425- 440 ,(2001) , 10.1007/3-540-45353-9_31
Jens Groth, Short Pairing-Based Non-interactive Zero-Knowledge Arguments international conference on the theory and application of cryptology and information security. pp. 321- 340 ,(2010) , 10.1007/978-3-642-17373-8_19
Paulo S. L. M. Barreto, Michael Naehrig, Pairing-Friendly elliptic curves of prime order international conference on selected areas in cryptography. ,vol. 3897, pp. 319- 331 ,(2005) , 10.1007/11693383_22
Rosario Gennaro, Craig Gentry, Bryan Parno, Non-interactive verifiable computing: outsourcing computation to untrusted workers international cryptology conference. ,vol. 2009, pp. 465- 482 ,(2010) , 10.1007/978-3-642-14623-7_25
Ralph C. Merkle, A Certified Digital Signature international cryptology conference. pp. 218- 238 ,(1989) , 10.1007/0-387-34805-0_21
Radu Sion, Query execution assurance for outsourced databases very large data bases. pp. 601- 612 ,(2005)