Practical applications of homomorphic encryption

SECRYPT 2012 - Proceedings of the International Conference on Security and Cryptography

Volumn , Issue , 2012, Pages 5-14

  Brenner, Michael ^a   Perl, Henning ^a   Smith, Matthew ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Encrypted search; Homomorphic encryption; Private information retrieval

Indexed keywords

ENCRYPTED SEARCH; FIRST CONSTRUCTIONS; FULLY HOMOMORPHIC ENCRYPTION; HOMOMORPHIC CRYPTOGRAPHY; HOMOMORPHIC SCHEME; HOMOMORPHIC-ENCRYPTIONS; PERFORMANCE LIMITATIONS; PRIVATE INFORMATION RETRIEVAL; SEARCH TERMS;

SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 84867639558     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Brakerski, Z. and Vaikuntanathan, V. (2011). Efficient fully homomorphic encryption from (standard) lwe. Cryptology ePrint Archive, Report 2011/344. http://eprint.iacr.org/.
2. Brenner, M., Wiebelitz, J., von Voigt, G., and Smith, M. (2011). A smart-gentry based software system for secret program execution. In Proc. of the International Conference on Security and Cryptography SECRYPT. SciTePress.
3. Coron, J.-S., Mandal, A., Naccache, D., and Tibouchi, M. (2011). Fully homomorphic encryption over the integers with shorter public keys. In Advances in Cryptology CRYPTO 2011, volume 6841 of LNCS. Springer Berlin / Heidelberg.
4. Damgrd, I.,Meldgaard, S., and Nielsen, J. (2011). Perfectly secure oblivious ram without random oracles. In Theory of Cryptography, volume 6597 of LNCS. Springer Berlin / Heidelberg.
5. Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. In Proc. of the 41st annual ACM symposium on Theory of computing, STOC '09, New York, NY, USA. ACM.
6. Gentry, C., Halevi, S., and Vaikuntanathan, V. (2010). ihop homomorphic encryption and rerandomizable yao circuits. In Advances in Cryptology - CRYPTO 2010, volume 6223 of LNCS. Springer Berlin / Heidelberg.
7. Goldreich, O. (1987). Towards a theory of software protection and simulation by oblivious rams. In Proc. of the 19th annual ACM symposium on Theory of computing, STOC '87, New York, NY, USA. ACM.
8. Goldreich, O. and Ostrovsky, R. (1996). Software protection and simulation on oblivious rams. J. ACM, 43.
9. Goodrich, M. and Mitzenmacher, M. (2011). Privacypreserving access of outsourced data via oblivious ram simulation. In Automata, Languages and Programming, volume 6756 of LNCS. Springer Berlin / Heidelberg.
10. Kolesnikov, V., Sadeghi, A.-R., and Schneider, T. (2009a). How to combine homomorphic encryption and garbled circuits improved circuits and computing the minimum distance efficiently.
11. Kolesnikov, V., Sadeghi, A.-R., and Schneider, T. (2009b). Improved garbled circuit building blocks and applications to auctions and computing minima. In Cryptology and Network Security, volume 5888 of LNCS. Springer Berlin / Heidelberg.
12. Malkhi, D., Nisan, N., Pinkas, B., and Sella, Y. (2004). Fairplay - a secure two-party computation system. In Proc. of the 13th conference on USENIX Security Symposium - Volume 13, SSYM'04, Berkeley, CA, USA. USENIX Association.
13. Naehrig, M., Lauter, K., and Vaikuntanathan, V. (2011). Can homomorphic encryption be practical? In Proc. of the 3rd ACM workshop on Cloud computing security workshop, CCSW '11, New York, NY, USA. ACM.
14. Pinkas, B. and Reinman, T. (2010). Oblivious ram revisited. In Advances in Cryptology - CRYPTO 2010, volume 6223 of LNCS. Springer Berlin / Heidelberg.
15. Smart, N. and Vercauteren, F. (2010). Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography, PKC 2010, volume 6056 of LNCS. Springer Berlin / Heidelberg.
16. Stehl, D. and Steinfeld, R. (2010). Faster fully homomorphic encryption. In Advances in Cryptology - ASIACRYPT 2010, volume 6477 of LNCS. Springer Berlin / Heidelberg.
17. Trapnell, C. and Salzberg, S. (2009). How to map billions of short reads onto genomes. Nature Biotechnology, 27(5).
18. Yao, A. C. (1982). Protocols for secure computations. In SFCS '82: Proc. of the 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, DC, USA.