How practical is homomorphically encrypted program execution? An implementation and performance evaluation

Proc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012

Volumn , Issue , 2012, Pages 375-382

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

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

encrypted circuits; homomorphic encryption; secret program execution; secure function evaluation

Indexed keywords

COMPLETE SYSTEM; DYNAMIC PARAMETERS; FLEXIBLE PROTOTYPES; HOMOMORPHIC CRYPTOGRAPHY; HOMOMORPHIC-ENCRYPTIONS; MACHINE CODES; MEMORY ACCESS; PERFORMANCE EVALUATION; PROCESSOR ARCHITECTURES; PROGRAM EXECUTION; REAL-WORLD PROBLEM; RUNTIME ENVIRONMENTS; RUNTIMES; SECURE FUNCTION EVALUATION; SUB-COMPONENTS; SYSTEM ARCHITECTURES; VIRTUAL MACHINES;

MEMORY ARCHITECTURE; PROGRAM ASSEMBLERS; UBIQUITOUS COMPUTING;

CRYPTOGRAPHY;

EID: 84868130489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TrustCom.2012.174     Document Type: Conference Paper

References (18)

1. Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. In Advances in Cryptology - CRYPTO 2011, LNCS. 2011.
2. Michael Brenner, Jan Wiebelitz, Gabriele von Voigt, and Matthew Smith. Secret program execution in the cloud applying homomorphic encryption. In Proceedings of the 5th IEEE International Conference on Digital Ecosystems, DEST'11. IEEE, 2011.
3. Jean-Sébastien Coron, Avradip Mandal, David Naccache, and Mehdi Tibouchi. Fully homomorphic encryption over the integers with shorter public keys. In Advances in Cryptology - CRYPTO 2011, LNCS. 2011.
4. Ivan Damgård, Sigurd Meldgaard, and Jesper Nielsen. Perfectly secure oblivious ram without random oracles. In Theory of Cryptography, LNCS. 2011.
5. Craig Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st annual ACM symposium on Theory of computing, STOC '09. ACM, 2009.
6. Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. ihop homomorphic encryption and rerandomizable yao circuits. In Advances in Cryptology - CRYPTO 2010, LNCS. 2010.
7. Oded Goldreich. Towards a theory of software protection and simulation by oblivious rams. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, STOC '87, New York, NY, USA, 1987. ACM.
8. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43:431-473, May 1996.
9. Michael Goodrich and Michael Mitzenmacher. Privacy-preserving access of outsourced data via oblivious ram simulation. In Automata, Languages and Programming, LNCS. 2011.
10. Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. How to combine homomorphic encryption and garbled circuits improved circuits and computing the minimum distance efficiently.
11. Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In Cryptology and Network Security, LNCS. 2009.
12. Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. Fairplay - a secure two-party computation system. In Proceedings of the 13th conference on USENIX Security Symposium - Volume 13, SSYM'04. USENIX Association, 2004.
13. Michael Naehrig, Kristin Lauter, and Vinod Vaikuntanathan. Can homomorphic encryption be practical? In Proceedings of the 3rd ACM workshop on Cloud computing security workshop, CCSW '11, New York, NY, USA, 2011. ACM.
14. Benny Pinkas and Tzachy Reinman. Oblivious ram revisited. In Advances in Cryptology - CRYPTO 2010, LNCS. 2010.
15. N. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography, PKC 2010, volume 6056 of LNCS, pages 420-443. Springer Berlin / Heidelberg, 2010.
16. Damien Stehlé and Ron Steinfeld. Faster fully homomorphic encryption. In Advances in Cryptology - ASIACRYPT 2010, LNCS. 2010.
17. Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT 2010, LNCS. 2010.
18. Andrew C.C. Yao. Protocols for secure computations. In SFCS '82: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science.