Skip to main content
SpringerLink
Log in

Analysis of the State of the Art

  • Chapter
  • First Online:
Privately and Publicly Verifiable Computing Techniques

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 777 Accesses

Abstract

In this chapter, all verifiable computing schemes discussed in this survey are summarized and their properties are highlighted. We first summarize for each type of verifiable computing scheme presented in the survey, i.e. proof and argument based verifiable computing, verifiable computing from fully homomorphic encryption, homomorphic authenticators, verifiable computing frameworks from functional encryption and functional signatures, and verifiable computing for specific applications, which properties they provide. Like in the rest of the survey the properties concerned are the level of security the scheme provides, how efficient the verification process is, whether anyone or only the client can check the correctness of the result, which function class the verifiable computing scheme supports, and whether privacy with respect to the input and/or output data is given. Afterwards, we discuss to what extent the schemes provide long-term privacy, i.e. are secure against attackers with unbounded computation power. Finally, we discuss for which approaches implementations are available.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. B. Applebaum, Y. Ishai, E. Kushilevitz, From secrecy to soundness: efficient verification via secure computation, in Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Proceedings, Part I, Bordeaux, 6–10 July 2010, pp. 152–163

    Google Scholar 

  2. M. Backes, D. Fiore, R.M. Reischuk, Verifiable delegation of computation on outsourced data, in 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS’13, Berlin, 4–8 November 2013, pp. 863–874

    Google Scholar 

  3. M. Backes, M. Barbosa, D. Fiore, R.M. Reischuk, ADSNARK: nearly practical and privacy-preserving proofs on authenticated data, in 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, 17–21 May 2015, pp. 271–286

    Google Scholar 

  4. M. Barbosa, P. Farshim, Delegatable homomorphic encryption with applications to secure outsourcing of computation, in Topics in Cryptology - CT-RSA 2012 - The Cryptographers’ Track at the RSA Conference 2012, Proceedings, San Francisco, CA, 27 February–2 March 2012, pp. 296–312

    Google Scholar 

  5. E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, M. Virza, SNARKs for C: verifying program executions succinctly and in zero knowledge, in Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Proceedings, Part II, Santa Barbara, CA, 18–22 August 2013, pp. 90–108

    Google Scholar 

  6. E. Ben-Sasson, A. Chiesa, E. Tromer, M. Virza, Succinct non-interactive zero knowledge for a von Neumann architecture, in Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, 20–22 August 2014, pp. 781–796

    Google Scholar 

  7. E. Boyle, S. Goldwasser, I. Ivan, Functional signatures and pseudorandom functions, in Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings, Buenos Aires, 26–28 March 2014, pp. 501–519

    Google Scholar 

  8. Z. Brakerski, C. Gentry, V. Vaikuntanathan, Fully homomorphic encryption without bootstrapping. Electron. Colloq. Comput. Complex. 18, 111 (2011)

    Google Scholar 

  9. B. Braun, A.J. Feldman, Z. Ren, S.T.V. Setty, A.J. Blumberg, M. Walfish, Verifying computations with state, in ACM SIGOPS 24th Symposium on Operating Systems Principles, SOSP ’13, Farmington, PA, 3–6 November 2013, pp. 341–357

    Google Scholar 

  10. D. Catalano, D. Fiore, R. Gennaro, K. Vamvourellis, Algebraic (trapdoor) one-way functions and their applications, in TCC (2013), pp. 680–699

    Google Scholar 

  11. D. Catalano, D. Fiore, B. Warinschi, Homomorphic signatures with efficient verification for polynomial functions, in Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings, Part I, Santa Barbara, CA, 17–21 August 2014, pp. 371–389

    Google Scholar 

  12. D. Catalano, D. Fiore, L. Nizzardo, Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys, in Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings, Part II, Santa Barbara, CA, 16–20 August 2015, pp. 254–274

    Google Scholar 

  13. B. Chevallier-Mames, J. Coron, N. McCullagh, D. Naccache, M. Scott, Secure delegation of elliptic-curve pairing, in Smart Card Research and Advanced Application, 9th IFIP WG 8.8/11.2 International Conference, CARDIS 2010, Proceedings, Passau, 14–16 April 2010, pp. 24–35

    Google Scholar 

  14. K. Chung, Y.T. Kalai, S.P. Vadhan, Improved delegation of computation using fully homomorphic encryption, in Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Proceedings, Santa Barbara, CA, 15–19 August 2010, pp. 483–501

    Google Scholar 

  15. C. Costello, C. Fournet, J. Howell, M. Kohlweiss, B. Kreuter, M. Naehrig, B. Parno, S. Zahur, Geppetto: versatile verifiable computation, in 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, 17–21 May 2015, pp. 253–270

    Google Scholar 

  16. K. Elkhiyaoui, M. Önen, M. Azraoui, R. Molva, Efficient techniques for publicly verifiable delegation of computation, in Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2016, Xi’an, 30 May–3 June 2016, pp. 119–128

    Google Scholar 

  17. D. Fiore, R. Gennaro, V. Pastro, Efficiently Verifiable computation on encrypted data, in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, 3–7 November 2014, pp. 844–855

    Google Scholar 

  18. R. Gennaro, C. Gentry, B. Parno, Non-interactive verifiable computing: outsourcing computation to untrusted workers, in Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Proceedings, Santa Barbara, CA, 15–19 August 2010, pp. 465–482

    Google Scholar 

  19. C. Gentry, D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, in Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, 6–8 June 2011, pp. 99–108

    Google Scholar 

  20. http://cs.utexas.edu/pepper. Retrieved 18 Apr 2016

  21. http://research.microsoft.com/verifcomp/. Retrieved 18 Apr 2016

  22. https://github.com/scipr-lab/libsnark. Retrieved 18 Apr 2016

  23. A.E. Kosba, D. Papadopoulos, C. Papamanthou, M.F. Sayed, E. Shi, N. Triandopoulos, TRUESET: faster verifiable set computations, in Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, 20–22 August 2014, pp. 765–780

    Google Scholar 

  24. J. Lai, R.H. Deng, H. Pang, J. Weng, Verifiable computation on outsourced encrypted data, in Computer Security - ESORICS 2014 - 19th European Symposium on Research in Computer Security, Proceedings, Part I, Wroclaw, 7–11 September 2014, pp. 273–291

    Google Scholar 

  25. C. Papamanthou, E. Shi, R. Tamassia, Signatures of correct computation, in TCC (2013), pp. 222–242

    Google Scholar 

  26. B. Parno, M. Raykova, V. Vaikuntanathan, How to delegate and verify in public: verifiable computation from attribute-based encryption, in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings, Taormina, 19–21 March 2012, pp. 422–439

    Google Scholar 

  27. B. Parno, J. Howell, C. Gentry, M. Raykova, Pinocchio: nearly practical verifiable computation, in 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, 19–22 May 2013, pp. 238–252

    Google Scholar 

  28. S.T.V. Setty, R. McPherson, A.J. Blumberg, M. Walfish, Making argument systems for outsourced computation practical (sometimes), in 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, CA, 5–8 February 2012

    Google Scholar 

  29. S.T.V. Setty, V. Vu, N. Panpalia, B. Braun, A.J. Blumberg, M. Walfish, Taking proof-based verified computation a few steps closer to practicality, in Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, 8–10 August 2012, pp. 253–268

    Google Scholar 

  30. S.T.V. Setty, B. Braun, V. Vu, A.J. Blumberg, B. Parno, M. Walfish, Resolving the conflict between generality and plausibility in verified computation, in Eighth Eurosys Conference 2013, EuroSys ’13, Prague, 14–17 April 2013, pp. 71–84

    Google Scholar 

  31. Y. Sun, Y. Yu, X. Li, K. Zhang, H. Qian, Y. Zhou, Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations, in Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings, Part I, Melbourne, VIC, 4–6 July 2016, pp. 293–309

    Google Scholar 

  32. C. Tang, Y. Chen, Efficient non-interactive verifiable outsourced computation for arbitrary functions. IACR Cryptology ePrint Archive (2014), p. 439

    Google Scholar 

  33. J. Thaler, Time-optimal interactive proofs for circuit evaluation, in Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Proceedings, Part II, Santa Barbara, CA, 18–22 August 2013, pp. 71–89

    Google Scholar 

  34. J. Thaler, M. Roberts, M. Mitzenmacher, H. Pfister, Verifiable computation with massively parallel interactive proofs, in 4th USENIX Workshop on Hot Topics in Cloud Computing, HotCloud’12, Boston, MA, 12–13 June 2012

    Google Scholar 

  35. V. Vu, S.T.V. Setty, A.J. Blumberg, M. Walfish, A hybrid architecture for interactive verifiable computation, in 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, 19–22 May 2013, pp. 223–237

    Google Scholar 

  36. R.S. Wahby, S.T.V. Setty, Z. Ren, A.J. Blumberg, M. Walfish, Efficient RAM and control flow in verifiable outsourced computation, in 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, CA, 8–11 February 2015

    Google Scholar 

  37. G. Xu, G.T. Amariucai, Y. Guan, Verifiable computation with reduced informational costs and computational costs, in Computer Security - ESORICS 2014 - 19th European Symposium on Research in Computer Security, Proceedings, Part I, Wroclaw, 7–11 September 2014, pp. 292–309

    Google Scholar 

  38. L.F. Zhang, R. Safavi-Naini, Generalized homomorphic MACs with efficient verification, in ASIAPKC’14, Proceedings of the 2nd ACM Wookshop on ASIA Public-Key Cryptography, Kyoto, 3 June 2014, pp. 3–12

    Google Scholar 

  39. F. Zhang, X. Ma, S. Liu, Efficient computation outsourcing for inverting a class of homomorphic functions. Inf. Sci. 286, 19–28 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, Technische Universität Darmstadt, Darmstadt, Hessen, Germany

    Denise Demirel, Lucas Schabhüser & Johannes Buchmann

Authors
  1. Denise Demirel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lucas Schabhüser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Johannes Buchmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 The Author(s)

About this chapter

Cite this chapter

Demirel, D., Schabhüser, L., Buchmann, J. (2017). Analysis of the State of the Art. In: Privately and Publicly Verifiable Computing Techniques. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-53798-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53798-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53797-9

  • Online ISBN: 978-3-319-53798-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation