Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 194

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Geppetto: Versatile Verifiable Computation

Open access
Costello, Craig, Fournet, Cedric, Howell, Jon, Kohlweiss, Markulf, Kreuter, Benjamin, Naehrig, Michael, Parno, Bryan, Zahur, Samee · 2015 · 2015 IEEE Symposium on Security and Privacy

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sp.2015.23

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Research works printed but not linked: 51

  1. kosba, 0, TrueSet: Nearly practical verifiable set computations, Proc of USENIX Security 2014
  2. 10.1145/129712.129782 · DOI · Paper page
  3. groth, 0, Short pairing-based non-interactive zero-knowledge arguments, IACR ASIACRYPT 2010
  4. golle, 0, Uncheatable distributed computations, Proc CT-RSA 2001
  5. 10.1137/0218012 · DOI · Paper page
  6. 10.1145/1374376.1374396 · DOI · Paper page
  7. kilian, 1989, Uses of Randomness in Algorithms and Protocols
  8. karypis, 2013, METIS 5.1.0: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, Technical Report
  9. 10.1007/978-3-540-79456-1_6 · DOI
  10. 10.1007/978-3-540-78967-3_24 · DOI · Paper page
  11. gennaro, 0, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, Proceedings of IACR CRYPTO 2010
  12. 10.1145/505452.505453 · DOI · Paper page
  13. 10.1007/978-3-642-38348-9_37 · DOI · Paper page
  14. 10.1145/273865.273901 · DOI · Paper page
  15. 10.1007/978-3-642-15497-3_10 · DOI
  16. 10.1145/2090236.2090245 · DOI · Paper page
  17. cocks, 0, Identity-based cryptosystems based on the Weil pairing, Manuscript 2001
  18. 10.1007/3-540-48658-5_19 · DOI · Paper page
  19. costello, 2014, Geppetto: Versatile verifiable computation, Cryptology ePrint Archive Report
  20. escala, 2013, Fine-tuning Groth-Sahai proofs, Cryptology ePrint Archive Report
  21. 10.1145/2517872.2517878 · DOI
  22. setty, 0, Making argument systems for outsourced computation practical (some-times), Proceedings of the ISOC NDSS 2012
  23. sion, 0, Query execution assurance for outsourced databases, Proc of VLDB 2005
  24. wahby, 2015, Efficient RAM and control flow in verifiable outsourced compu-tation, Proc ISOC NDSS
  25. 10.1007/978-3-540-78524-8_1 · DOI · Paper page
  26. thaler, 0, Time-optimal interactive proofs for circuit evaluation, Proc of IACR CRYPTO 2013
  27. ben-sasson, 0, Succinct non-interactive zero knowledge for a von Neumann architecture, Proc of USENIX Security 2014
  28. 10.1145/2488608.2488623 · DOI · Paper page
  29. 10.1109/CGO.2004.1281665 · DOI · Paper page
  30. 10.1109/SFCS.1991.185352 · DOI
  31. boneh, 0, Identity-based encryption from the Weil pairing, Proceedings of IACR CRYPTO 2001
  32. bosma, 1997, The Magma algebra sys-tem. I. the user language, J Symbolic Comput, 24, 10.1006/jsco.1996.0125 · DOI · Paper page
  33. 10.1016/j.jco.2004.09.009 · DOI
  34. 10.1145/2517349.2522733 · DOI · Paper page
  35. camenisch, 0, Efficient non-trans-ferable anonymous multi-show credential system with optional anonymity revocation, EuroCrypt 2001
  36. 10.1145/509978.509980 · DOI
  37. 10.1007/11889663_7 · DOI
  38. backes, 2012, Automated synthesis of privacy-preserving distributed applications, Proc of ISOC NDSS
  39. 10.1109/SP.2015.24 · DOI
  40. barreto, 2006, Pairing-friendly elliptic curves of prime order, Selected Areas in Cryptography (SAC), 10.1007/11693383_22 · DOI · Paper page
  41. baldimtsi, 0, Anonymous credentials light, Proceedings of ACM CCS 2013
  42. 10.4086/toc.2013.v009a021 · doi:10.4086/toc.2013.v009a021
  43. 10.1109/SP.2014.36 · DOI · Paper page
  44. 10.1145/2465351.2465359 · DOI
  45. ben-sasson, 2014, Scalable zero knowledge via cycles of elliptic curves, Proc of CRYPTO
  46. miyaji, 2001, New explicit conditions of elliptic curve traces for FR-reduction, IEICE Trans on Fundamentals, 84
  47. 10.1145/2046556.2046564 · DOI · Paper page
  48. 10.1007/978-1-4614-1460-5 · DOI
  49. meiklejohn, 2010, ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash, Proc of USENIX
  50. 10.1109/ISCA.2005.14 · DOI
  51. merkle, 1989, A certified digital signature, Proc of CRYPTO

Cited by

Metadata

Authors
Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., & Zahur, S.
Venue
2015 IEEE Symposium on Security and Privacy
Publisher
IEEE
Published
2015-05
Volume
2014
Pages
253-270
ISSN
1081-6011 (ISSN-L)
OpenAlex
W1563556756
Cited by
194
References
3
FWCI
11.93
Type
conference paper
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.