Comparison-based computations over fully homomorphic encrypted data

IEEE International Conference on Communications

Volumn , Issue , 2014, Pages

  Togan, Mihai ^a   Pleşca, Cezar ^a  

^a CertSign   (Romania)

Author keywords

encrypted comparison; HElib; homomorphic encryption; learning with errors

Indexed keywords

COMMUNICATION;

COMPUTE RESOURCES; COST SAVING; ENCRYPTED COMPARISON; ENCRYPTED DATA; FULLY HOMOMORPHIC ENCRYPTION; HELIB; HO-MOMORPHIC ENCRYPTIONS; LEARNING WITH ERRORS;

CRYPTOGRAPHY;

EID: 84907340000     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICComm.2014.6866760     Document Type: Conference Paper

References (18)

1. R. Rivest, L. Adleman and M. Dertouzos, "On Data Banks And Privacy Homomorphisms", Foundations of Secure Computation, pp. 169-180, 1978.
2. O. Regev, "On Lattices, Learning With Errors, Random Linear Codes And Cryptography", ACM Symposium On Theory of Computing, pp. 84-93, 2005.
3. J. Garay, B. Schoenmakers and J. Villegas, "Practical and Secure Solutions For Integer Comparison", Public Key Cryptography, Lecture Notes in Computer Science, pp. 330-342, 2007.
4. N. Gama and P. Q. Nguyen, "Predicting Lattice Reduction", Advances in Cryptology, Eurocrypt 2010, Lecture Notes in Computer Science, pp. 31-51, 2008.
5. C. Gentry, "A Fully Homomorphic Encryption Scheme", PhD Thesis, Stanford University, http://crypto.stanford.edu/craig, 2009.
6. C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices", ACM Symposium On Theory of Computing, pp. 169-178, 2009.
7. C. Peikert, "Public-key Cryptosystems From The Worst-Case Shortest Vector Problem: Extended Abstract", ACM Symposium On Theory of Computing, pp. 333-342, 2009.
8. M. van Dijk, C. Gentry, S. Halevi and V. Vaikuntanathan, "Fully Homomorphic Encryption Over The Integers", Advances in Cryptology, Eurocrypt 2010, Lecture Notes in Computer Science, pp. 24-43, 2010.
9. C. Gentry, "Computing Arbitrary Functions Of Encrypted Data", Communications Of The ACM, pp. 97-105, 2010.
10. V. Lyubashevsky, C. Peikert and O. Regev, "On Ideal Lattices And Learning With Errors Over Rings", Eurocrypt, Lecture Notes in Computer Science, pp. 1-23, 2010.
11. M. Naehrig, K. Lauter and V. Vaikuntanathan, "Can Homomorphic Encryption Be Practical? ", ACM Workshop on Cloud Computing Security Workshop, pp. 113-124, 2011.
12. N. Howgrave-Graham, "Approximate Integer Common Divisors", CaLC, Lecture Notes in Computer Science, pp. 51-66, 2011.
13. Z. Brakerski and V. Vaikuntanathan, "Efficient Fully Homomorphic Encryption From (Standard) LWE", IEEE Symposium on Foundations of Computer Science, pp. 97-106, 2011.
14. C. Gentry and S. Halevi, "Implementing Gentry's Fully-Homomorphic Encryption Scheme", Advances in Cryptology, EuroCrypt 2011, Lecture Notes in Computer Science, pp. 129-148, 2011.
15. Z. Brakerski, C. Gentry and V. Vaikuntanathan, "Fully Homomorphic Encryption without Bootstrapping", Innovations in Theoretical Computer Science Conference, pp. 309-325, 2012.
16. C. Gentry, S. Halevi and N. Smart, "Homomorphic Evaluation Of The AES Circuit", Advances in Cryptology, Crypto 2012, Lecture Notes in Computer Science, pp. 850-867, 2012.
17. N. Smart and F. Vercauteren, "Fully Homomorphic SIMD Operations", Designs, Codes and Cryptography, 2012.
18. T. Graepel, K. Lauter and M. Naehrig, "ML Confidential: Machine Learning on Encrypted Data", Information Security and Cryptology, Lecture Notes in Computer Science, pp. 1-21, 2013.