Homomorphic encryption: From private-key to public-key

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6597 LNCS, Issue , 2011, Pages 219-234

  Rothblum, Ron ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CIPHERTEXTS; HO-MOMORPHIC ENCRYPTIONS; PRIVATE KEY; PRIVATE-KEY ENCRYPTION; PUBLIC KEY SCHEMES; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION SCHEME;

PUBLIC KEY CRYPTOGRAPHY;

EID: 79953192140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_14     Document Type: Conference Paper

References (14)

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. 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)
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
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
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
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
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
8. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
9. Goldreich, O.: Computational complexity: a conceptual perspective. SIGACT News 39(3), 35-39 (2008)
10. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270-299 (1984)
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)
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)
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)
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