{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:23:24Z","timestamp":1773912204277,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K035584\/1"],"award-info":[{"award-number":["EP\/K035584\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["780701"],"award-info":[{"award-number":["780701"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,11]]},"DOI":"10.1145\/3338469.3358940","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["On the Feasibility and Impact of Standardising Sparse-secret LWE Parameter Sets for Homomorphic Encryption"],"prefix":"10.1145","author":[{"given":"Benjamin R.","family":"Curtis","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}]},{"given":"Rachel","family":"Player","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"EUROCRYPT","author":"Albrecht Martin R.","year":"2017","unstructured":"Martin R. Albrecht . 2017. On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL . In EUROCRYPT 2017 , Part II (LNCS ), , Jean-S\u00e9 bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10211 . Springer , Heidelberg, 103--129. https:\/\/doi.org\/10.1007\/978--3--319--56614--6_4 10.1007\/978--3--319--56614--6_4 Martin R. Albrecht. 2017. On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL. In EUROCRYPT 2017, Part II (LNCS ), , Jean-S\u00e9 bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10211. Springer, Heidelberg, 103--129. https:\/\/doi.org\/10.1007\/978--3--319--56614--6_4"},{"key":"e_1_3_2_1_3_1","volume-title":"NTRU Schemes!. In Security and Cryptography for Networks","author":"Albrecht Martin R.","unstructured":"Martin R. Albrecht , Benjamin R. Curtis , Amit Deo , Alex Davidson , Rachel Player , Eamonn W. Postlethwaite , Fernando Virdia , and Thomas Wunderer . 2018b. Estimate All the LWE , NTRU Schemes!. In Security and Cryptography for Networks , Dario Catalano and Roberto De Prisco (Eds.). Springer International Publishing , 351--367. Martin R. Albrecht, Benjamin R. Curtis, Amit Deo, Alex Davidson, Rachel Player, Eamonn W. Postlethwaite, Fernando Virdia, and Thomas Wunderer. 2018b. Estimate All the LWE, NTRU Schemes!. In Security and Cryptography for Networks, Dario Catalano and Roberto De Prisco (Eds.). Springer International Publishing, 351--367."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_11"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_6_1","volume-title":"Post-quantum Key Exchange - A New Hope. In 25th USENIX Security Symposium, USENIX Security 16","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim , L\u00e9 o Ducas , Thomas P\u00f6 ppelmann, and Peter Schwabe . 2016 a. Post-quantum Key Exchange - A New Hope. In 25th USENIX Security Symposium, USENIX Security 16 , Thorsten Holz and Stefan Savage (Eds.). USENIX Association, 327--343. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim Erdem Alkim, L\u00e9 o Ducas, Thomas P\u00f6 ppelmann, and Peter Schwabe. 2016a. Post-quantum Key Exchange - A New Hope. In 25th USENIX Security Symposium, USENIX Security 16, Thorsten Holz and Stefan Savage (Eds.). USENIX Association, 327--343. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"e_1_3_2_1_7_1","volume-title":"USENIX Security 2016 ,","author":"Alkim Erdem","unstructured":"Erdem Alkim , L\u00e9o Ducas , Thomas P\u00f6ppelmann , and Peter Schwabe . 2016b. Post-quantum Key Exchange - A New Hope . In USENIX Security 2016 , , Thorsten Holz and Stefan Savage (Eds.). USENIX Association , 327--343. Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe. 2016b. Post-quantum Key Exchange - A New Hope. In USENIX Security 2016 , , Thorsten Holz and Stefan Savage (Eds.). USENIX Association, 327--343."},{"key":"e_1_3_2_1_8_1","volume-title":"Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. In CRYPTO 2009 (LNCS ), , Shai Halevi (Ed.)","volume":"5677","author":"Applebaum Benny","year":"2009","unstructured":"Benny Applebaum , David Cash , Chris Peikert , and Amit Sahai . 2009 . Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. In CRYPTO 2009 (LNCS ), , Shai Halevi (Ed.) , Vol. 5677 . Springer, Heidelberg, 595--618. https:\/\/doi.org\/10.1007\/978--3--642-03356--8_35 10.1007\/978--3--642-03356--8_35 Benny Applebaum, David Cash, Chris Peikert, and Amit Sahai. 2009. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. In CRYPTO 2009 (LNCS ), , Shai Halevi (Ed.), Vol. 5677. Springer, Heidelberg, 595--618. https:\/\/doi.org\/10.1007\/978--3--642-03356--8_35"},{"key":"e_1_3_2_1_9_1","volume-title":"Ran Gilad-Bachrach, Roger A. Hallman, Zhicong Huang, Xiaoqian Jiang, Ranjit Kumaresan, Bradley A. Malin, Heidi Sofia, Yongsoo Song, and Shuang Wang.","author":"Archer David","year":"2017","unstructured":"David Archer , Lily Chen , Jung Hee Cheon , Ran Gilad-Bachrach, Roger A. Hallman, Zhicong Huang, Xiaoqian Jiang, Ranjit Kumaresan, Bradley A. Malin, Heidi Sofia, Yongsoo Song, and Shuang Wang. 2017 . Applications of Homomorphic Encryption . Technical Report. HomomorphicEncryption.org, Redmond WA, USA. David Archer, Lily Chen, Jung Hee Cheon, Ran Gilad-Bachrach, Roger A. Hallman, Zhicong Huang, Xiaoqian Jiang, Ranjit Kumaresan, Bradley A. Malin, Heidi Sofia, Yongsoo Song, and Shuang Wang. 2017. Applications of Homomorphic Encryption . Technical Report. HomomorphicEncryption.org, Redmond WA, USA."},{"key":"e_1_3_2_1_10_1","volume-title":"New Algorithms for Learning in Presence of Errors. ICALP 2011","volume":"6755","author":"Arora Sanjeev","year":"2011","unstructured":"Sanjeev Arora and Rong Ge . 2011 . New Algorithms for Learning in Presence of Errors. ICALP 2011 , Part I (LNCS ), Luca Aceto, Monika Henzinger, and Jiri Sgall (Eds.) , Vol. 6755 . Springer, Heidelberg, 403--415. https:\/\/doi.org\/10.1007\/978--3--642--22006--7_34 10.1007\/978--3--642--22006--7_34 Sanjeev Arora and Rong Ge. 2011. New Algorithms for Learning in Presence of Errors. ICALP 2011, Part I (LNCS ), Luca Aceto, Monika Henzinger, and Jiri Sgall (Eds.), Vol. 6755. Springer, Heidelberg, 403--415. https:\/\/doi.org\/10.1007\/978--3--642--22006--7_34"},{"key":"e_1_3_2_1_11_1","volume-title":"STACS '86 (Lecture Notes in Computer Science), , Kurt Mehlhorn (Ed.)","volume":"82","author":"Babai L\u00e1szl\u00f3","year":"1985","unstructured":"L\u00e1szl\u00f3 Babai . 1985 . On Lov\u00e1sz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version) . In STACS '86 (Lecture Notes in Computer Science), , Kurt Mehlhorn (Ed.) , Vol. 82 . Springer, 13--20. L\u00e1szl\u00f3 Babai. 1985. On Lov\u00e1sz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version). In STACS '86 (Lecture Notes in Computer Science), , Kurt Mehlhorn (Ed.), Vol. 82. Springer, 13--20."},{"key":"e_1_3_2_1_12_1","volume-title":"Galbraith","author":"Bai Shi","year":"2014","unstructured":"Shi Bai and Steven D . Galbraith . 2014 . Lattice Decoding Attacks on Binary LWE. In ACISP 14 (LNCS ), , Willy Susilo and Yi Mu (Eds.), Vol. 8544 . Springer , Heidelberg, 322--337. https:\/\/doi.org\/10.1007\/978--3--319-08344--5_21 10.1007\/978--3--319-08344--5_21 Shi Bai and Steven D. Galbraith. 2014. Lattice Decoding Attacks on Binary LWE. In ACISP 14 (LNCS ), , Willy Susilo and Yi Mu (Eds.), Vol. 8544. Springer, Heidelberg, 322--337. https:\/\/doi.org\/10.1007\/978--3--319-08344--5_21"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_15_1","volume-title":"45th ACM STOC ,","author":"Brakerski Zvika","unstructured":"Zvika Brakerski , Adeline Langlois , Chris Peikert , Oded Regev , and Damien Stehl\u00e9 . 2013. Classical hardness of learning with errors . In 45th ACM STOC , , Dan Boneh, Tim Roughgarden, and Joan Feigenbaum (Eds.). ACM Press , 575--584. https:\/\/doi.org\/10.1145\/2488608.2488680 10.1145\/2488608.2488680 Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehl\u00e9. 2013. Classical hardness of learning with errors. In 45th ACM STOC , , Dan Boneh, Tim Roughgarden, and Joan Feigenbaum (Eds.). ACM Press, 575--584. https:\/\/doi.org\/10.1145\/2488608.2488680"},{"key":"e_1_3_2_1_17_1","volume-title":"AFRICACRYPT 16 (LNCS ),","author":"Buchmann Johannes A.","unstructured":"Johannes A. Buchmann , Florian G\u00f6pfert , Rachel Player , and Thomas Wunderer . 2016. On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack . In AFRICACRYPT 16 (LNCS ), , David Pointcheval, Abderrahmane Nitaj, and Tajjeeddine Rachidi (Eds.), Vol. 9646 . Springer , Heidelberg , 24--43. https:\/\/doi.org\/10.1007\/978--3--319--31517--1_2 10.1007\/978--3--319--31517--1_2 Johannes A. Buchmann, Florian G\u00f6pfert, Rachel Player, and Thomas Wunderer. 2016. On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack. In AFRICACRYPT 16 (LNCS ), , David Pointcheval, Abderrahmane Nitaj, and Tajjeeddine Rachidi (Eds.), Vol. 9646. Springer, Heidelberg, 24--43. https:\/\/doi.org\/10.1007\/978--3--319--31517--1_2"},{"key":"e_1_3_2_1_19_1","volume-title":"EUROCRYPT","author":"Chen Hao","year":"2019","unstructured":"Hao Chen , Ilaria Chillotti , and Yongsoo Song . 2019. Improved Bootstrapping for Approximate Homomorphic Encryption . In EUROCRYPT 2019 , Part II (LNCS ), Yuval Ishai and Vincent Rijmen (Eds.), Vol. 11477 . Springer , Heidelberg, 34--54. https:\/\/doi.org\/10.1007\/978--3-030--17656--3_2 10.1007\/978--3-030--17656--3_2 Hao Chen, Ilaria Chillotti, and Yongsoo Song. 2019. Improved Bootstrapping for Approximate Homomorphic Encryption. In EUROCRYPT 2019, Part II (LNCS ), Yuval Ishai and Vincent Rijmen (Eds.), Vol. 11477. Springer, Heidelberg, 34--54. https:\/\/doi.org\/10.1007\/978--3-030--17656--3_2"},{"key":"e_1_3_2_1_20_1","volume-title":"EUROCRYPT","author":"Chen Hao","year":"2018","unstructured":"Hao Chen and Kyoohyung Han . 2018. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping . In EUROCRYPT 2018 , Part I (LNCS ), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10820 . Springer , Heidelberg, 315--337. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_12 10.1007\/978--3--319--78381--9_12 Hao Chen and Kyoohyung Han. 2018. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In EUROCRYPT 2018, Part I (LNCS ), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10820. Springer, Heidelberg, 315--337. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_12"},{"key":"e_1_3_2_1_21_1","volume-title":"ASIACRYPT 2011 (LNCS ), , Dong Hoon Lee and Xiaoyun Wang (Eds.)","volume":"7073","author":"Chen Yuanmi","unstructured":"Yuanmi Chen and Phong Q. Nguyen . 2011. BKZ 2.0: Better Lattice Security Estimates . In ASIACRYPT 2011 (LNCS ), , Dong Hoon Lee and Xiaoyun Wang (Eds.) , Vol. 7073 . Springer, Heidelberg, 1--20. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_1 10.1007\/978--3--642--25385-0_1 Yuanmi Chen and Phong Q. Nguyen. 2011. BKZ 2.0: Better Lattice Security Estimates. In ASIACRYPT 2011 (LNCS ), , Dong Hoon Lee and Xiaoyun Wang (Eds.), Vol. 7073. Springer, Heidelberg, 1--20. https:\/\/doi.org\/10.1007\/978--3--642--25385-0_1"},{"key":"e_1_3_2_1_22_1","volume-title":"EUROCRYPT 2012 (LNCS ), , David Pointcheval and Thomas Johansson (Eds.)","volume":"7237","author":"Chen Yuanmi","unstructured":"Yuanmi Chen and Phong Q. Nguyen . 2012. Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers . In EUROCRYPT 2012 (LNCS ), , David Pointcheval and Thomas Johansson (Eds.) , Vol. 7237 . Springer, Heidelberg, 502--519. https:\/\/doi.org\/10.1007\/978--3--642--29011--4_30 10.1007\/978--3--642--29011--4_30 Yuanmi Chen and Phong Q. Nguyen. 2012. Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. In EUROCRYPT 2012 (LNCS ), , David Pointcheval and Thomas Johansson (Eds.), Vol. 7237. Springer, Heidelberg, 502--519. https:\/\/doi.org\/10.1007\/978--3--642--29011--4_30"},{"key":"e_1_3_2_1_23_1","volume-title":"EUROCRYPT","author":"Cheon Jung Hee","year":"2018","unstructured":"Jung Hee Cheon , Kyoohyung Han , Andrey Kim , Miran Kim , and Yongsoo Song . 2018. Bootstrapping for Approximate Homomorphic Encryption . In EUROCRYPT 2018 , Part I (LNCS ), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10820 . Springer , Heidelberg, 360--384. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_14 10.1007\/978--3--319--78381--9_14 Jung Hee Cheon, Kyoohyung Han, Andrey Kim, Miran Kim, and Yongsoo Song. 2018. Bootstrapping for Approximate Homomorphic Encryption. In EUROCRYPT 2018, Part I (LNCS ), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10820. Springer, Heidelberg, 360--384. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_14"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2925425"},{"key":"e_1_3_2_1_25_1","volume-title":"ASIACRYPT","author":"Cheon Jung Hee","year":"2017","unstructured":"Jung Hee Cheon , Andrey Kim , Miran Kim , and Yong Soo Song . 2017. Homomorphic Encryption for Arithmetic of Approximate Numbers . In ASIACRYPT 2017 , Part I (LNCS ), Tsuyoshi Takagi and Thomas Peyrin (Eds.), Vol. 10624 . Springer , Heidelberg, 409--437. https:\/\/doi.org\/10.1007\/978--3--319--70694--8_15 10.1007\/978--3--319--70694--8_15 Jung Hee Cheon, Andrey Kim, Miran Kim, and Yong Soo Song. 2017. Homomorphic Encryption for Arithmetic of Approximate Numbers. In ASIACRYPT 2017, Part I (LNCS ), Tsuyoshi Takagi and Thomas Peyrin (Eds.), Vol. 10624. Springer, Heidelberg, 409--437. https:\/\/doi.org\/10.1007\/978--3--319--70694--8_15"},{"key":"e_1_3_2_1_26_1","volume-title":"Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR. In SCN 18 (LNCS ),","author":"Cheon Jung Hee","year":"2018","unstructured":"Jung Hee Cheon , Duhyeong Kim , Joohee Lee , and Yongsoo Song . 2018 . Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR. In SCN 18 (LNCS ), , Dario Catalano and Roberto De Prisco (Eds.), Vol. 11035 . Springer , Heidelberg , 160--177. https:\/\/doi.org\/10.1007\/978--3--319--98113-0_9 10.1007\/978--3--319--98113-0_9 Jung Hee Cheon, Duhyeong Kim, Joohee Lee, and Yongsoo Song. 2018. Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR. In SCN 18 (LNCS ), , Dario Catalano and Roberto De Prisco (Eds.), Vol. 11035. Springer, Heidelberg, 160--177. https:\/\/doi.org\/10.1007\/978--3--319--98113-0_9"},{"key":"e_1_3_2_1_27_1","volume-title":"TFHE: Fast Fully Homomorphic Encryption Library. (","author":"Chillotti Ilaria","year":"2016","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . August 2016 . TFHE: Fast Fully Homomorphic Encryption Library. ( August 2016). https:\/\/tfhe.github.io\/tfhe\/. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. August 2016. TFHE: Fast Fully Homomorphic Encryption Library. ( August 2016). https:\/\/tfhe.github.io\/tfhe\/."},{"key":"e_1_3_2_1_29_1","volume-title":"Michael Mitzenmacher (Ed.)","author":"Gentry Craig","unstructured":"Craig Gentry . 2009. Fully homomorphic encryption using ideal lattices. 41st ACM STOC , , Michael Mitzenmacher (Ed.) . ACM Press , 169--178. https:\/\/doi.org\/10.1145\/1536414.1536440 10.1145\/1536414.1536440 Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. 41st ACM STOC , , Michael Mitzenmacher (Ed.). ACM Press, 169--178. https:\/\/doi.org\/10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_30_1","volume-title":"Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012 (LNCS ), , Reihaneh Safavi-Naini and Ran Canetti (Eds.)","volume":"7417","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry , Shai Halevi , and Nigel P. Smart . 2012 . Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012 (LNCS ), , Reihaneh Safavi-Naini and Ran Canetti (Eds.) , Vol. 7417 . Springer, Heidelberg, 850--867. https:\/\/doi.org\/10.1007\/978--3--642--3 2009 --5_49 10.1007\/978--3--642--32009--5_49 Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012. Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012 (LNCS ), , Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417. Springer, Heidelberg, 850--867. https:\/\/doi.org\/10.1007\/978--3--642--32009--5_49"},{"key":"e_1_3_2_1_31_1","volume-title":"Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017 ,","author":"G\u00f6pfert Florian","unstructured":"Florian G\u00f6pfert , Christine van Vredendaal , and Thomas Wunderer . 2017. A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE . In Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017 , , Tanja Lange and Tsuyoshi Takagi (Eds.). Springer , Heidelberg , 184--202. https:\/\/doi.org\/10.1007\/978--3--319--59879--6_11 10.1007\/978--3--319--59879--6_11 Florian G\u00f6pfert, Christine van Vredendaal, and Thomas Wunderer. 2017. A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE. In Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017 , , Tanja Lange and Tsuyoshi Takagi (Eds.). Springer, Heidelberg, 184--202. https:\/\/doi.org\/10.1007\/978--3--319--59879--6_11"},{"key":"e_1_3_2_1_32_1","unstructured":"Shai Halevi. 2018. HElib. https:\/\/github.com\/shaih\/HElib . (2018).  Shai Halevi. 2018. HElib. https:\/\/github.com\/shaih\/HElib . (2018)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2913850"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243837"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.2196\/medinform.8805"},{"key":"e_1_3_2_1_38_1","unstructured":"SNU Cryptography Lab. 2018. HEAAN . https:\/\/github.com\/snucrypto\/HEAAN . (2018).  SNU Cryptography Lab. 2018. HEAAN . https:\/\/github.com\/snucrypto\/HEAAN . (2018)."},{"key":"e_1_3_2_1_39_1","volume-title":"CT-RSA 2011 (LNCS )","author":"Lindner Richard","year":"1907","unstructured":"Richard Lindner and Chris Peikert . 2011. Better Key Sizes (and Attacks) for LWE-Based Encryption . In CT-RSA 2011 (LNCS ) , Aggelos Kiayias (Ed.), Vol. 6558 . Springer , Heidelberg , 319--339. https:\/\/doi.org\/10.1007\/978--3--642-- 1907 4--2_21 10.1007\/978--3--642--19074--2_21 Richard Lindner and Chris Peikert. 2011. Better Key Sizes (and Attacks) for LWE-Based Encryption. In CT-RSA 2011 (LNCS ), Aggelos Kiayias (Ed.), Vol. 6558. Springer, Heidelberg, 319--339. https:\/\/doi.org\/10.1007\/978--3--642--19074--2_21"},{"key":"e_1_3_2_1_40_1","volume-title":"Nguyen","author":"Liu Mingjie","year":"2013","unstructured":"Mingjie Liu and Phong Q . Nguyen . 2013 . Solving BDD by Enumeration : An Update. In CT-RSA 2013 (LNCS ), , Ed Dawson (Ed.), Vol. 7779 . Springer , Heidelberg, 293--309. https:\/\/doi.org\/10.1007\/978--3--642--36095--4_19 10.1007\/978--3--642--36095--4_19 Mingjie Liu and Phong Q. Nguyen. 2013. Solving BDD by Enumeration: An Update. In CT-RSA 2013 (LNCS ), , Ed Dawson (Ed.), Vol. 7779. Springer, Heidelberg, 293--309. https:\/\/doi.org\/10.1007\/978--3--642--36095--4_19"},{"key":"e_1_3_2_1_41_1","unstructured":"Microsoft. 2018. SEAL . https:\/\/github.com\/Microsoft\/SEAL . (2018).  Microsoft. 2018. SEAL . https:\/\/github.com\/Microsoft\/SEAL . (2018)."},{"key":"e_1_3_2_1_42_1","unstructured":"New Jersey Institute of Technology. 2019. PALISADE . https:\/\/git.njit.edu\/palisade\/PALISADE . (2019).  New Jersey Institute of Technology. 2019. PALISADE . https:\/\/git.njit.edu\/palisade\/PALISADE . (2019)."},{"key":"e_1_3_2_1_43_1","volume-title":"37th ACM STOC , , Harold N","author":"Regev Oded","unstructured":"Oded Regev . 2005. On lattices, learning with errors, random linear codes, and cryptography . In 37th ACM STOC , , Harold N . Gabow and Ronald Fagin (Eds.). ACM Press , 84--93. https:\/\/doi.org\/10.1145\/1060590.1060603 10.1145\/1060590.1060603 Oded Regev. 2005. On lattices, learning with errors, random linear codes, and cryptography. In 37th ACM STOC , , Harold N. Gabow and Ronald Fagin (Eds.). ACM Press, 84--93. https:\/\/doi.org\/10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_14"},{"key":"e_1_3_2_1_45_1","volume-title":"mbox","author":"William Stein","year":"2017","unstructured":"William Stein et al mbox . 2017 . Sage Mathematics Software Version 8.0 . The Sage Development Team . http:\/\/www.sagemath.org. William Stein et almbox. 2017. Sage Mathematics Software Version 8.0 . The Sage Development Team. http:\/\/www.sagemath.org."}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338469.3358940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:48Z","timestamp":1750201968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":40,"alternative-id":["10.1145\/3338469.3358940","10.1145\/3338469"],"URL":"https:\/\/doi.org\/10.1145\/3338469.3358940","relation":{},"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}