{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:30:16Z","timestamp":1775251816616,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1606362"],"award-info":[{"award-number":["CNS-1606362"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1054495"],"award-info":[{"award-number":["CCF-1054495"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243828","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T13:38:33Z","timestamp":1539697113000},"page":"1020-1037","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["ALCHEMY"],"prefix":"10.1145","author":[{"given":"Eric","family":"Crockett","sequence":"first","affiliation":[{"name":"University of Michigan & Georgia Institute of Technology, Ann Arbor, MI, USA"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Chad","family":"Sharp","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Martin R. Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. 430--454. Martin R. Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. 430--454.","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_2_2_1","volume-title":"Post-quantum Key Exchange - A New Hope. In USENIX Security Symposium .","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim , L\u00e9o Ducas , Thomas P\u00f6ppelmann , and Peter Schwabe . 2016 . Post-quantum Key Exchange - A New Hope. In USENIX Security Symposium . Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe. 2016. Post-quantum Key Exchange - A New Hope. In USENIX Security Symposium ."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Jacob Alperin-Sheriff and Chris Peikert. 2013. Practical Bootstrapping in Quasilinear Time. In CRYPTO. 1--20. Jacob Alperin-Sheriff and Chris Peikert. 2013. Practical Bootstrapping in Quasilinear Time. In CRYPTO. 1--20.","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Jacob Alperin-Sheriff and Chris Peikert. 2014. Faster Bootstrapping with Polynomial Error. In CRYPTO. 297--314. Jacob Alperin-Sheriff and Chris Peikert. 2014. Faster Bootstrapping with Polynomial Error. In CRYPTO. 297--314.","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Abhishek Banerjee and Chris Peikert. 2014. New and Improved Key-Homomorphic Pseudorandom Functions. In CRYPTO. 353--370. Abhishek Banerjee and Chris Peikert. 2014. New and Improved Key-Homomorphic Pseudorandom Functions. In CRYPTO. 353--370.","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_2_10_1","volume-title":"Hart William Montgomery, and Ananth Raghunathan","author":"Boneh Dan","year":"2013","unstructured":"Dan Boneh , Kevin Lewi , Hart William Montgomery, and Ananth Raghunathan . 2013 . Key Homomorphic PRFs and Their Applications. In CRYPTO. 410--428. Dan Boneh, Kevin Lewi, Hart William Montgomery, and Ananth Raghunathan. 2013. Key Homomorphic PRFs and Their Applications. In CRYPTO. 410--428."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. 2011. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. In CRYPTO. 505--524. Zvika Brakerski and Vinod Vaikuntanathan. 2011. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. In CRYPTO. 505--524.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554799"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Rachel Player. 2017. Simple Encrypted Arithmetic Library - SEAL v2.1. In Financial Cryptography and Data Security. 3--18. Hao Chen Kim Laine and Rachel Player. 2017. Simple Encrypted Arithmetic Library - SEAL v2.1. In Financial Cryptography and Data Security. 3--18.","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"e_1_3_2_2_18_1","volume-title":"Tancr\u00e8de Lepoint, Mehdi Tibouchi, and Aaram Yun.","author":"Cheon Jung Hee","year":"2013","unstructured":"Jung Hee Cheon , Jean-S\u00e9bastien Coron , Jinsu Kim , Moon Sung Lee , Tancr\u00e8de Lepoint, Mehdi Tibouchi, and Aaram Yun. 2013 . Batch Fully Homomorphic Encryption over the Integers. In EUROCRYPT. 315--335. Jung Hee Cheon, Jean-S\u00e9bastien Coron, Jinsu Kim, Moon Sung Lee, Tancr\u00e8de Lepoint, Mehdi Tibouchi, and Aaram Yun. 2013. Batch Fully Homomorphic Encryption over the Integers. In EUROCRYPT. 315--335."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron Avradip Mandal David Naccache and Mehdi Tibouchi. 2011. Fully Homomorphic Encryption over the Integers with Shorter Public Keys. In CRYPTO. 487--504. Jean-S\u00e9bastien Coron Avradip Mandal David Naccache and Mehdi Tibouchi. 2011. Fully Homomorphic Encryption over the Integers with Shorter Public Keys. In CRYPTO. 487--504.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978402"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_2_25_1","volume-title":"FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640.","author":"Ducas L\u00e9","year":"2015","unstructured":"L\u00e9 o Ducas and Daniele Micciancio . 2015 . FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640. L\u00e9 o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9184-y"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Shai Halevi. 2011. Implementing Gentry's Fully-Homomorphic Encryption Scheme. In EUROCRYPT. 129--148. Craig Gentry and Shai Halevi. 2011. Implementing Gentry's Fully-Homomorphic Encryption Scheme. In EUROCRYPT. 129--148.","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590628.2590632"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Amit Sahai and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO. 75--92. Craig Gentry Amit Sahai and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO. 75--92.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_36_1","volume-title":"d.}. HElib: an implementation of homomorphic encryption. https:\/\/github.com\/shaih\/HElib, last retrieved","author":"Halevi Shai","year":"2016","unstructured":"Shai Halevi and Victor Shoup . {n. d.}. HElib: an implementation of homomorphic encryption. https:\/\/github.com\/shaih\/HElib, last retrieved August 2016 . Shai Halevi and Victor Shoup. {n. d.}. HElib: an implementation of homomorphic encryption. https:\/\/github.com\/shaih\/HElib, last retrieved August 2016."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Shai Halevi and Victor Shoup. 2014. Algorithms in HElib. In CRYPTO. 554--571. Shai Halevi and Victor Shoup. 2014. Algorithms in HElib. In CRYPTO. 554--571.","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Shai Halevi and Victor Shoup. 2015. Bootstrapping for HElib. In EUROCRYPT. 641--670. Shai Halevi and Victor Shoup. 2015. Bootstrapping for HElib. In EUROCRYPT. 641--670.","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2015.08.007"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32202-0_3"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_2"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948139"},{"key":"e_1_3_2_2_44_1","volume-title":"Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. 287--302","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi , Noam Nisan , Benny Pinkas , and Yaron Sella . 2004 . Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. 287--302 . Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium. 287--302."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45239-0_3"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255329.1255333"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.48"},{"key":"e_1_3_2_2_49_1","volume-title":"Dertouzos","author":"Rivest Ronald L.","year":"1978","unstructured":"Ronald L. Rivest , Len Adleman , and Michael L . Dertouzos . 1978 . On Data Banks and Privacy Homomorphisms. Foundations of secure computation, Vol. 4 , 11 (1978), 169--180. Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. 1978. On Data Banks and Privacy Homomorphisms. Foundations of secure computation, Vol. 4, 11 (1978), 169--180."},{"key":"e_1_3_2_2_50_1","unstructured":"Victor Shoup. 2006. A library for doing number theory. http:\/\/www.shoup.net\/ntl\/ version 9.8.1. Victor Shoup. 2006. A library for doing number theory. http:\/\/www.shoup.net\/ntl\/ version 9.8.1."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao. 1982. Theory and Applications of Trapdoor Functions (Extended Abstract). In FOCS. 80--91. Andrew Chi-Chih Yao. 1982. Theory and Applications of Trapdoor Functions (Extended Abstract). In FOCS. 80--91.","DOI":"10.1109\/SFCS.1982.45"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243828","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243828","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:19:47Z","timestamp":1775247587000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243828"}},"subtitle":["A Language and Compiler for Homomorphic Encryption Made easY"],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":49,"alternative-id":["10.1145\/3243734.3243828","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243828","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}