{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:07:08Z","timestamp":1648912028804},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tc.2018.2808962","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T21:45:36Z","timestamp":1519681536000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits"],"prefix":"10.1109","author":[{"given":"Vincent","family":"Migliore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Bonnoron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Fontaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"ref38","first-page":"281","article-title":"Fast multiplication of large numbers","volume":"7","author":"schnhage","year":"1971","journal-title":"IEEE Comput"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref32","first-page":"138","article-title":"Additively\n homomorphic encryption with d-operand multiplications","author":"melchor","year":"2010","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref31","first-page":"1","article-title":"On ideal\n lattices and learning with errors over rings","author":"lyubashevsky","year":"2010","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref30","first-page":"318","article-title":"A comparison of the homomorphic encryption schemes FV and YASHE","author":"lepoint","year":"2014","journal-title":"Proc Int Conf Cryptology Africa"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/2004932"},{"key":"ref35","article-title":"How (not) to instantiate ring-LWE","author":"peikert","year":"2016","journal-title":"Proc Int Conf Security Commun Netw"},{"key":"ref34","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity\n classes","author":"paillier","year":"1999","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref40","first-page":"714","article-title":"The complexity of a scheme of functional elements realizing the\n multiplication of integers","volume":"7","author":"toom","year":"1963","journal-title":"Soviet Mathematics-doklady"},{"key":"ref11","first-page":"1","article-title":"Lattice-based FHE as secure as PKE","author":"brakerski","year":"2014","journal-title":"Proc 3rd Innovat Theor Comput Sci Conf"},{"key":"ref12","first-page":"313","article-title":"Stream\n ciphers: A practical solution for efficient homomorphic-ciphertext compression","author":"canteaut","year":"2016","journal-title":"Proc Sixth ACM SIGSOFT Int'l Symp Foundations of Software Eng"},{"key":"ref13","first-page":"593","article-title":"Practical privacy-preserving medical diagnosis using\n homomorphic encryption","author":"carpov","year":"2016","journal-title":"Proc IEEE Int Conf Cloud Comput"},{"key":"ref14","article-title":"BKZ 2.0: Better lattice security estimates","author":"chen","year":"2013"},{"key":"ref15","first-page":"3","article-title":"Faster fully homomorphic\n encryption: Bootstrapping in less than 0.1 seconds","author":"chillotti","year":"2016","journal-title":"Proc Adv Crypotology Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref16","first-page":"325","article-title":"Which ring based somewhat homomorphic encryption scheme is best?","author":"costache","year":"2016","journal-title":"Proc Cryptology Track of the RSA Conf"},{"key":"ref17","article-title":"FV-NFLlib.","year":"2016"},{"key":"ref18","article-title":"Flattening NTRU for evaluation key free homomorphic encryption","author":"dor\u00f6z","year":"2016"},{"key":"ref19","first-page":"617","article-title":"FHEW: Bootstrapping homomorphic encryption in less than a second","author":"ducas","year":"2015","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref28","article-title":"Simple\n encrypted arithmetic library - SEAL (v2.3)","author":"laine","year":"2017"},{"key":"ref4","article-title":"(Finite) field work: Choosing the best encoding of numbers for FHE computation","author":"jschke","year":"2017","journal-title":"Proc Int Conf Cryptology Netw Security"},{"key":"ref27","first-page":"3","article-title":"Revisiting lattice attacks on overstretched NTRU parameters","author":"kirchner","year":"2017","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"ref6","first-page":"311","article-title":"Implementing the Rivest Shamir and Adleman public key encryption\n algorithm on a standard digital signal processor","author":"barrett","year":"1986","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref29","first-page":"3","article-title":"Private computation on encrypted genomic data","author":"lauter","year":"2014","journal-title":"Proc 3rd Int Conf Cryptology Inf Security Latin"},{"key":"ref5","first-page":"151","article-title":"Efficient reductions in cyclotomic rings - application to ring-LWE based FHE schemes","author":"bajard","year":"2017","journal-title":"Proc 27th Annu ACM Symp Appl"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-642-45239-0_4","article-title":"Improved security for a ring-based fully\n homomorphic encryption scheme","author":"bos","year":"2013","journal-title":"Cryptography and Coding 6th IMA Int Conf"},{"key":"ref7","article-title":"Large\n FHE gates from tensored homomorphic accumulator","author":"bonnoron","year":"2017"},{"key":"ref2","first-page":"103","article-title":"On dual lattice attacks against small-secret LWE and parameter\n choices in HElib and SEAL","author":"albrecht","year":"2017","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref9","first-page":"868","article-title":"Fully homomorphic encryption without modulus switching from\n classical GapSVP","author":"brakerski","year":"2012","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref1","first-page":"153","article-title":"A subfield\n lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and graded encoding schemes","author":"albrecht","year":"2016","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref20","article-title":"Somewhat practical fully homomorphic encryption","author":"fan","year":"2012"},{"key":"ref22","article-title":"A fully homomorphic encryption scheme","author":"gentry","year":"2009"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete\n logarithms","volume":"31","author":"gamal","year":"1985","journal-title":"IEEE Trans Inform Theory"},{"key":"ref24","article-title":"Helib.","author":"halevi","year":"2018"},{"key":"ref23","first-page":"75","article-title":"Homomorphic\n encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based","author":"gentry","year":"2013","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2500576"},{"key":"ref25","first-page":"595","article-title":"Multiplication of multi-digit numbers on automata","volume":"44","author":"karatsuba","year":"1963","journal-title":"Physics-doklady"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/4358213\/08302942.pdf?arnumber=8302942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:17:40Z","timestamp":1642004260000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8302942\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2808962","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2018]]}}}