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.
Chapter PDF
Similar content being viewed by others
Keywords
- Encryption Scheme
- Decryption Algorithm
- Homomorphic Encryption
- Oblivious Transfer
- Private Information Retrieval
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
Barak, B.: Cryptography course - Lecture notes, COS 433. Princeton University, Computer Science Department (Spring (2010), http://www.cs.princeton.edu/courses/archive/spring10/cos433
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)
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
Efron, B., Stein, C.: The jackknife estimate of variance. The Annals of StatisticsĀ 9(3), 586ā596 (1981), http://www.jstor.org/stable/2240822
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
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
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
Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.Ā 2. Cambridge University Press, Cambridge (2004)
Goldreich, O.: Computational complexity: a conceptual perspective. SIGACT NewsĀ 39(3), 35ā39 (2008)
Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System SciencesĀ 28(2), 270ā299 (1984)
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)
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)
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)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 International Association for Cryptologic Research
About this paper
Cite this paper
Rothblum, R. (2011). Homomorphic Encryption: From Private-Key to Public-Key. In: Ishai, Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19571-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-19571-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19570-9
Online ISBN: 978-3-642-19571-6
eBook Packages: Computer ScienceComputer Science (R0)