Geppetto: Versatile Verifiable Computation

Craig Costello; Cédric Fournet; Jon Howell; Markulf Kohlweiss; Benjamin Kreuter; Michael Naehrig; Bryan Parno; Samee Zahur

doi:10.1109/SP.2015.23

Geppetto: Versatile Verifiable Computation

Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	2015 IEEE Symposium on Security and Privacy
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	253-270
Number of pages	18
ISBN (Electronic)	978-1-4673-6949-7
DOIs	https://doi.org/10.1109/SP.2015.23
Publication status	Published - 20 Jul 2015
Event	2015 IEEE Symposium on Security and Privacy - The Fairmont, San Jose, CA, United States Duration: 18 May 2015 → 20 May 2015 https://www.ieee-security.org/TC/SP2015/

Publication series

Name
Publisher	IEEE
ISSN (Print)	1081-6011
ISSN (Electronic)	2375-1207

Conference

Conference	2015 IEEE Symposium on Security and Privacy
Country/Territory	United States
City	San Jose, CA
Period	18/05/15 → 20/05/15
Internet address	https://www.ieee-security.org/TC/SP2015/

Access to Document

10.1109/SP.2015.23Licence: All Rights Reserved

GeppettoAccepted author manuscript, 622 KB

http://ieeexplore.ieee.org/document/7163030/Licence: All Rights Reserved

Markulf Kohlweiss
- markulf.kohlweissed.acuk
- School of Informatics - Senior Lecturer in Security and Privacy
- Laboratory for Foundations of Computer Science
- Foundations of Computation
Person: Academic: Research Active , Academic: Research Active (Teaching)

Cite this

@inproceedings{37920e5565aa4a42b678ef5902a5dd45,

title = "Geppetto: Versatile Verifiable Computation",

abstract = "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.",

author = "Craig Costello and C{\'e}dric Fournet and Jon Howell and Markulf Kohlweiss and Benjamin Kreuter and Michael Naehrig and Bryan Parno and Samee Zahur",

year = "2015",

month = jul,

day = "20",

doi = "10.1109/SP.2015.23",

language = "English",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

pages = "253--270",

booktitle = "2015 IEEE Symposium on Security and Privacy",

address = "United States",

note = "2015 IEEE Symposium on Security and Privacy ; Conference date: 18-05-2015 Through 20-05-2015",

url = "https://www.ieee-security.org/TC/SP2015/",

}

Costello, C, Fournet, C, Howell, J, Kohlweiss, M, Kreuter, B, Naehrig, M, Parno, B & Zahur, S 2015, Geppetto: Versatile Verifiable Computation. in 2015 IEEE Symposium on Security and Privacy. Institute of Electrical and Electronics Engineers (IEEE), pp. 253-270, 2015 IEEE Symposium on Security and Privacy, San Jose, CA, United States, 18/05/15. https://doi.org/10.1109/SP.2015.23

TY - GEN

T1 - Geppetto: Versatile Verifiable Computation

AU - Costello, Craig

AU - Fournet, Cédric

AU - Howell, Jon

AU - Kohlweiss, Markulf

AU - Kreuter, Benjamin

AU - Naehrig, Michael

AU - Parno, Bryan

AU - Zahur, Samee

PY - 2015/7/20

Y1 - 2015/7/20

N2 - 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.

AB - 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.

U2 - 10.1109/SP.2015.23

DO - 10.1109/SP.2015.23

M3 - Conference contribution

SP - 253

EP - 270

BT - 2015 IEEE Symposium on Security and Privacy

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - 2015 IEEE Symposium on Security and Privacy

Y2 - 18 May 2015 through 20 May 2015

ER -

Geppetto: Versatile Verifiable Computation

Abstract

Publication series

Conference

Access to Document

Fingerprint

Profiles

Markulf Kohlweiss

Cite this