{"id":419003,"date":"2017-08-08T14:14:54","date_gmt":"2017-08-08T21:14:54","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&p=419003"},"modified":"2025-08-06T11:57:46","modified_gmt":"2025-08-06T18:57:46","slug":"homomorphic-encryption-standardization-workshop","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/homomorphic-encryption-standardization-workshop\/","title":{"rendered":"Homomorphic Encryption Standardization Workshop"},"content":{"rendered":"\n\n
Website:<\/strong> http:\/\/homomorphicencryption.org\/ (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n Homomorphic encryption schemes which can handle one \u201coperation\u201d have been known for a long time, such as RSA, Paillier, or BGN which can do a little bit more. With the breakthrough work by Gentry in 2009, the community embarked on a new direction, basing \u201cFully\u201d Homomorphic Encryption Schemes on hard lattice problems. Now, 8 years later, we have multiple robust HE libraries available (HElib, SEAL, NFLlib, Palisade), which use schemes such as BGV and FV. With new optimizations and clever encoding techniques, they allow an amazing amount of practical computation to be done on encrypted data. Projects such as CryptoNets have already proved the feasibility of machine learning applications on encrypted data; the iDASH 2015 and 2016 competitions demonstrated computations on encrypted genomic data such as edit distance and string matching.\u00a0Most applications follow the \u201cleveled\u201d approach, where parameters are set to allow the evaluation of limited\u2014but arbitrarily high \u2013 depth circuits, making the computations practical, and avoiding costly bootstrapping operations.\u00a0For that reason, we drop the word \u201cFully\u201d, and simply refer to the area as Homomorphic Encryption (HE).<\/p>\n This workshop aimed to leverage this progress and to galvanize the community toward a common approach to standardization of Homomorphic Encryption.<\/p>\n \t\t\t Kristin Lauter (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Kim Laine (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Kurt Rohloff,\u00a0New Jersey Institute of Technology<\/p> Lily Chen,\u00a0National Institute of Standards and Technology<\/p> Roy Zimmermann (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> \t<\/div>\n\t \t \t\t\t David Carroll,\u00a0Microsoft Azure<\/p> Melissa Chase (opens in new tab)<\/span><\/a>,\u00a0Microsoft Research<\/p> Hao Chen (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Ran Gilad-Bachrach (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Ranjit Kumaresan (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> \t<\/div>\n\t \t Kim Laine (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Kristin Lauter (opens in new tab)<\/span><\/a>, Microsoft Research<\/p> Satya Lokam (opens in new tab)<\/span><\/a>, Microsoft Research India<\/p> Roy Zimmermann (opens in new tab)<\/span><\/a>, Microsoft Research Outreach<\/p> \t<\/div>\n\t<\/p>\t\t\t<\/div>\n\t\t<\/div>\n\t\t<\/p>\n \t\t\t Kyoohyung Han, Seoul National University<\/p> Zhicong Huang, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL)<\/p> Amir Jalali, Florida Atlantic University<\/p> Travis Morrison, Pennsylvania State University<\/p> \t<\/div>\n\t \t \t\t\t Lily Chen, National Institute of Standards and Technology\u00a0(NIST)<\/p> Roger Hallman, SPAWAR Systems Center Pacific<\/p> Dustin Moody, National Institute of Standards and Technology (NIST)<\/p> Heidi Sofia,\u00a0National Institutes of Health (NIH)\/National Human Genome Research Institute (NHGRI)<\/p> \t<\/div>\n\t \t \t\t\t David Archer,\u00a0Galois<\/p> Shai Halevi,\u00a0IBM<\/p> Alex Malozemoff,\u00a0Galois<\/p> Pascal Paillier,\u00a0Crypto Experts<\/p> \t<\/div>\n\t \t \t\t\t Brad Malin,\u00a0Vanderbilt University-GenoPri<\/p> Michael Brenner,\u00a0University of Hannover<\/p> Jung Hee Cheon,\u00a0Seoul National University<\/p> Wei Dai,\u00a0Worchester Polytechnic Institute<\/p> Jintai Ding,\u00a0University of Cincinnati<\/p> Shafi Goldwasser,\u00a0Massachusetts Institute of Technology<\/p> Sergey Gorbunov,\u00a0University of Waterloo<\/p> Jeffrey Hoffstein,\u00a0Brown University<\/p> Xiaoqian Jiang,\u00a0University of California at San Diego-iDASH<\/p> Miran Kim,\u00a0University of California at San Diego<\/p> \t<\/div>\n\t \t Yuriy Polyakov,\u00a0New Jersey Institute of Technology<\/p> Kurt Rohloff,\u00a0New Jersey Institute of Technology<\/p> Amit Sahai,\u00a0University of California at Los Angeles<\/p> Erkay Savas,\u00a0Sabanci University<\/p> Yongsoo Song,\u00a0Seoul National University<\/p> Berk Sunar,\u00a0Worchester Polytechnic Institute<\/p> Vinod Vaikuntanathan,\u00a0Massachusetts Institute of Technology<\/p> Shuang Wang,\u00a0University of California at San Diego-iDASH<\/p> \t<\/div>\n\t<\/p>\t\t\t<\/div>\n\t\t<\/div>\n\t\t<\/p>\n These white papers were drafted by three working groups at the workshop:<\/p>\n APIs (opens in new tab)<\/span><\/a>: This white paper discusses the design of API standards for homomorphic encryption.<\/p>\n Security (opens in new tab)<\/span><\/a>: This white paper discusses the security standards for homomorphic encryption.<\/p>\n Applications (opens in new tab)<\/span><\/a>:\u00a0This white paper discusses the motivating applications for homomorphic encryption.<\/p>\n To Protect Genetic Privacy, Encrypt your DNA (opens in new tab)<\/span><\/a>, Wired, August 23, 2017<\/p>\n Changing the security landscape for entrepreneurs<\/span> (opens in new tab)<\/span><\/a>, TechCrunch, August 17, 2017<\/span>Opens in a new tab<\/span><\/p>\n
This workshop brought together members of the Homomorphic\u00a0Encryption (HE)\u00a0community (opens in new tab)<\/span><\/a> to spend two days working together toward a plan for standardization.<\/p>\nOrganizers<\/h2>\n
Attendees<\/h2>\n
Microsoft<\/h3>\n
Microsoft Interns<\/h3>\n
Government Agencies<\/h3>\n
Industry<\/h3>\n
Academia<\/h3>\n
White Papers<\/h2>\n
In the News<\/h2>\n
Day 1 \u2013 July 13, 2017<\/h2>\n