Manual for Using Homomorphic Encryption for Bioinformatics: This paper provides a new homomorphic encryption algorithm and associated software for bioinformatics to enhance the security and privacy associated with computing on human genomes

Proceedings of the IEEE

Volumn 105, Issue 3, 2017, Pages 552-567

  Dowlin, Nathan ^a   Gilad Bachrach, Ran ^b   Laine, Kim ^b   Lauter, Kristin ^b   Naehrig, Michael ^b   Wernsing, John ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Bioinformatics; cryptography; data privacy; homomorphic encryption; public key

Indexed keywords

BIOINFORMATICS; DATA PRIVACY; DIGITAL STORAGE; GENES; HEALTH RISKS;

ARITHMETIC LIBRARY; ASSOCIATED SOFTWARES; HO-MOMORPHIC ENCRYPTIONS; PERSONAL HEALTH; PRIVACY REGULATION; PUBLIC KEYS; RESEARCH PURPOSE; SECURITY AND PRIVACY;

CRYPTOGRAPHY;

EID: 85012117558     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/JPROC.2016.2622218     Document Type: Conference Paper

References (38)

1. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proc. STOC, vol. 9, 2009, pp. 169-178.
2. Z. Brakerski and V. Vaikuntanathan, "Fully homomorphic encryption from ring-LWE and security for key dependent messages," in Advances in Cryptology-CRYPTO. New York, NY, USA: Springer-Verlag, 2011, pp. 505-524.
3. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, "(Leveled) fully homomorphic encryption without bootstrapping," in Proc. 3rd Innov. Theor. Comput. Sci. Conf., 2012, pp. 309-325.
4. C. Gentry, S. Halevi, and N. P. Smart, "Homomorphic evaluation of the AES circuit," in Advances in Cryptology-CRYPTO. New York, NY, USA: Springer-Verlag, 2012, pp. 850-867.
5. D. Stehlé and R. Steinfeld, "Making NTRU as secure as worst-case problems over ideal lattices," in Advances in Cryptology-EUROCRYPT. New York, NY, USA: Springer-Verlag, 2011, pp. 27-47.
6. J. W. Bos, K. Lauter, J. Loftus, and M. Naehrig, "Improved security for a ring-based fully homomorphic encryption scheme," in Cryptography and Coding. New York, NY, USA: Springer-Verlag, 2013, pp. 45-64.
7. M. Naehrig, K. Lauter, and V. Vaikuntanathan, "Can homomorphic encryption be practical?" in Proc. 3rd ACM Workshop Cloud Comput. Secur. Workshop, 2011, pp. 113-124.
8. J. Fan and F. Vercauteren, "Somewhat practical fully homomorphic encryption," IACR Cryptol. ePrint Arch., vol. 2012, p. 144, 2012.
9. M. Albrecht, S. Bai, and L. Ducas, "A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and graded encoding schemes," Cryptol. ePrint Arch., Tech. Rep. 2016/127, 2016.
10. P. Kirchner and P.-A. Fouque, "Comparison between subfield and straightforward attacks on NTRU," Cryptol. ePrint Arch., Tech. Rep. 2016/717, 2016.
11. V. Lyubashevsky, C. Peikert, and O. Regev, "On ideal lattices and learning with errors over rings," J. ACM, vol. 60, no. 6, 2013, Art. no. 43.
12. K. Laine, H. Chen, and R. Player, "Simple Encrypted Arithmetic Library-Seal (V2.1)," Sep. 2016. [Online]. Available: https://www. microsoft.com/en-us/research/publication/ simple-encrypted-arithmetic-library-seal-v2-1
13. R. Gilad-Bachrach, N. Dowlin, K. Laine, K. Lauter, M. Naehrig, and J. Wernsing, "CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy," in Proc. 33rd Int. Conf. Mach. Learn., 2016, pp. 201-210.
14. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," in Advances in Cryptology, ser. Lecture Notes in Computer Science, New York, NY, USA: Springer- Verlag, 2010, vol. 6110, pp. 24-43.
15. Z. Brakerski and V. Vaikuntanathan, "Efficient fully homomorphic encryption from (standard) LWE," in Proc. FOCS, 2011, pp. 97-106.
16. J. Fan and F. Vercauteren, "Somewhat practical fully homomorphic encryption," Cryptol. ePrint Arch., Tech. Rep. 2012/144, 2012. [Online]. Available: http://eprint.iacr.org/
17. A. López-Alt, E. Tromer, and V. Vaikuntanathan, "On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption," in Proc. 44th Annu. ACM Symp. Theory Comput., 2012, pp. 1219-1234.
18. Z. Brakerski, "Fully homomorphic encryption without modulus switching from classical GapSVP," in Advances in Cryptology-CRYPTO, R. Safavi-Naini and R. Canetti, Eds., ser. Lecture Notes in Computer Science, New York, NY, USA: Springer-Verlag, 2012, vol. 7417, pp. 868-886.
19. C. Gentry, A. Sahai, and B. Waters, "Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based," in Advances in Cryptology-CRYPTO, R. Canetti and J. A. Garay, Eds., ser. Lecture Notes in Computer Science, New York, NY, USA: Springer-Verlag, 2013, vol. 8042, pp. 75-92.
20. Z. Brakerski and V. Vaikuntanathan, "Lattice-based FHE as secure as PKE," in Proc. ITCS, 2014, pp. 1-12.
21. Z. Brakerski, C. Gentry, and S. Halevi, "Packed ciphertexts in LWE-based homomorphic encryption," in Public-Key Cryptography-PKC. New York, NY, USA: Springer-Verlag, 2013, pp. 1-13.
22. N. P. Smart and F. Vercauteren, "Fully homomorphic SIMD operations," Designs Codes Cryptogr., vol. 71, no. 1, pp. 57-81, 2014.
23. J. H. Cheon, M. Kim, and K. Lauter, "Homomorphic computation of edit distance," Cryptol. ePrint Arch., Tech. Rep. 2015/132, 2015. [Online]. Available: http://eprint.iacr.org/
24. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," J. ACM, vol. 56, no. 6, 2009, Art. no. 34.
25. C. Peikert, "Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract," in Proc. 41st Annu. ACM Symp. Theory Comput., 2009, pp. 333-342.
26. D. Micciancio and C. Peikert, "Trapdoors for lattices: Simpler, tighter, faster, smaller," in Advances Cryptology-EUROCRYPT. New York, NY, USA: Springer-Verlag, 2012, pp. 700-718.
27. Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, "Classical hardness of learning with errors," in Proc. 44th Annu. ACM Symp. Theory Comput., 2013, pp. 575-584.
28. T. Lepoint and M. Naehrig, "A comparison of the homomorphic encryption schemes FV and YASHE," in Progress in Cryptology- AFRICACRYPT. New York, NY, USA: Springer-Verlag, 2014, pp. 318-335.
29. J. van de Pol and N. P. Smart, "Estimating key sizes for high dimensional lattice-based systems," in Cryptography and Coding. New York, NY, USA: Springer-Verlag, 2013, pp. 290-303.
30. R. Lindner and C. Peikert, "Better key sizes (and attacks) for LWE-based encryption," in Topics in Cryptology-CT-RSA. New York, NY, USA: Springer-Verlag, 2011, pp. 319-339.
31. J. W. Bos, K. Lauter, and M. Naehrig, "Private predictive analysis on encrypted medical data," J. Biomed. Inf., vol. 50, pp. 234-243, Aug. 2014.
32. R Core Team, "R: A Language and Environment for Statistical Computing," Vienna, Austria, 2015. [Online]. Available: https://www.R-project.org
33. M. Kim and K. Lauter, "Private genome analysis through homomorphic encryption," Cryptol. ePrint Arch., Tech. Rep. 2015/965, 2015. [Online]. Available: http://eprint.iacr.org/
34. K. Lauter, A. López-Alt, and M. Naehrig, "Private computation on encrypted genomic data," in Progress in Cryptology-LATINCRYPT. New York, NY, USA: Springer-Verlag, 2014, pp. 3-27.
35. iDASH Privacy & Security Workshop, Secure Genome Analysis Competition, 2015. [Online]. Available: http://www.humangenomeprivacy.org/2015/competition-tasks.html
36. W. Bosma, J. Cannon, and C. Playoust, "The Magma algebra system. I. The user language," J. Symbolic Comput., vol. 24, pp. 235-265, 1997.
37. A. Festa et al., "Nuclear magnetic resonance lipoprotein abnormalities in prediabetic subjects in the insulin resistance atherosclerosis study," Circulation, vol. 111, no. 25, pp. 3465-3472, Jun. 2005.
38. B. P. Tabaei and W. H. Herman, "A multivariate logistic regression equation to screen for diabetes development and validation," Diabetes Care, vol. 25, no. 11, pp. 1999-2003, Nov. 2002.