Homomorphic Encryption: From Private-Key to Public-Key

  • Ron Rothblum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6597)

Abstract

We show how to transform any additively homomorphic private-key encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do not require them to be distributed like real ciphertexts).

Our resulting public-key scheme is homomorphic in the following sense. If the private-key scheme is i + 1-hop homomorphic with respect to some set of operations then the public-key scheme we construct is i-hop homomorphic with respect to the same set of operations.

References

  1. 1.
    Barak, B.: Cryptography course - Lecture notes, COS 433. Princeton University, Computer Science Department (Spring (2010), http://www.cs.princeton.edu/courses/archive/spring10/cos433
  2. 2.
    Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 122. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-13190-5 CrossRefGoogle Scholar
  4. 4.
    Efron, B., Stein, C.: The jackknife estimate of variance. The Annals of Statistics 9(3), 586–596 (1981), http://www.jstor.org/stable/2240822 CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985), http://dx.doi.org/10.1007/3-540-39568-7_2 CrossRefGoogle Scholar
  6. 6.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169–178. ACM, New York (2009), http://doi.acm.org/10.1145/1536414.1536440 CrossRefGoogle Scholar
  7. 7.
    Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155–172. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-14623-7 Google Scholar
  8. 8.
    Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)CrossRefMATHGoogle Scholar
  9. 9.
    Goldreich, O.: Computational complexity: a conceptual perspective. SIGACT News 39(3), 35–39 (2008)CrossRefGoogle Scholar
  10. 10.
    Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270–299 (1984)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28, 12–24 (1999)Google Scholar
  12. 12.
    Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, p. 364. IEEE Computer Society, Los Alamitos (1997)CrossRefGoogle Scholar
  13. 13.
    Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169–180. Academic Press, London (1978)Google Scholar
  14. 14.
    Rothblum, R.: Homomorphic encryption: from private-key to public-key. Electronic Colloquium on Computational Complexity (ECCC) 17, 146 (2010), http://eccc.hpi-web.de/report/2010/146 Google Scholar

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Ron Rothblum
    • 1
  1. 1.Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations