Advertisement

Verifiable Computing from Fully Homomorphic Encryption

Chapter
  • 591 Downloads
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Abstract

In this chapter we discuss approaches to verifiable computing that use fully homomorphic encryption (FHE) as a building block. First, we define homomorphic encryption and fully homomorphic encryption. Then, we describe the verifiable computing schemes using this primitive, i.e. “Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers” by Gennaro et al., “Improved Delegation of Computation Using Fully Homomorphic Encryption” by Chung et al., and “Efficient Non-Interactive Verifiable Outsourced Computation for Arbitrary Functions” by Chen et al. Note that using these solutions the client encrypts the data before it outsources it to the server. Thus, these solutions achieve input privacy. In addition, only the client can decrypt the result, which is why also output privacy is assured. However, on the downside all fully homomorphic encryption based schemes are only privately verifiable. Furthermore, all solutions are only secure against weak adversaries and providing efficient FHE schemes is still an open research challenge.

Keywords

Homomorphic Encryption Weak Security Verifiable Computation Weak Adversary Garble Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    F. Armknecht, C. Boyd, C. Carr, K. Gjøsteen, A. Jäschke, C.A. Reuter, M. Strand, A Guide to Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2015/1192 (2015), http://eprint.iacr.org/
  2. 2.
    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–501Google Scholar
  3. 3.
    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–482Google Scholar
  4. 4.
    C. Tang, Y. Chen, Efficient Non-interactive Verifiable Outsourced Computation for Arbitrary Functions. IACR Cryptology ePrint Archive (2014), p. 439Google Scholar
  5. 5.
    A.C. Yao, Protocols for secure computations (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, 3–5 November 1982, pp. 160–164Google Scholar
  6. 6.
    A.C. Yao, How to generate and exchange secrets (extended abstract), in 27th Annual Symposium on Foundations of Computer Science, Toronto, 27–29 October 1986, pp. 162–167Google Scholar

Copyright information

© The Author(s) 2017

Authors and Affiliations

  1. 1.Theoretische InformatikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations