Geppetto: Versatile Verifiable Computation

SP '15: Proceedings of the 2015 IEEE Symposium on Security and Privacy(2015)

引用 0|浏览304
暂无评分
摘要
Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak client to securely outsource computations to remote parties. Recent work has dramatically reduced the client's cost to verify the correctness of their results, but the overhead to produce proofs remains largely impractical.Geppetto introduces complementary techniques for reducing prover overhead and increasing prover flexibility. With Multi-QAPs, Geppetto reduces the cost of sharing state between computations (e.g., for MapReduce) or within a single computation by up to two orders of magnitude. Via a careful choice of cryptographic primitives, Geppetto's instantiation of bounded proof bootstrapping improves on prior bootstrapped systems by up to five orders of magnitude, albeit at some cost in universality. Geppetto also efficiently verifies the correct execution of proprietary (i.e., secret) algorithms. Finally, Geppetto's use of energy-saving circuits brings the prover's costs more in line with the program's actual (rather than worst-case) execution time.Geppetto is implemented in a full-fledged, scalable compiler and runtime that consume LLVM code generated from a variety of source C programs and cryptographic libraries.
更多
查看译文
关键词
cryptographic libraries,source C programs,LLVM code generation,compiler,energy-saving circuits,bootstrapped systems,bounded proof bootstrapping,cryptographic primitives,QAPs,prover flexibility,prover overhead reduction,correctness verification,outsource computation security,verifiable computation protocols,cloud computing,Geppetto
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要