{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:36:15Z","timestamp":1729672575025,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/cns.2018.8433140","type":"proceedings-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T22:09:06Z","timestamp":1534198146000},"page":"1-9","source":"Crossref","is-referenced-by-count":1,"title":["Delegating Elliptic-Curve Operations with Homomorphic Encryption"],"prefix":"10.1109","author":[{"given":"Carlos","family":"Aguilar-Melchor","sequence":"first","affiliation":[]},{"given":"Jean-Christophe","family":"Deneuville","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[]},{"given":"Tancrede","family":"Lepoint","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Ricosset","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-3710-8"},{"key":"ref33","article-title":"Fast and regular algorithms for scalar multiplication over elliptic curves","author":"rivain","year":"2011","journal-title":"Cryptology EPrint Archive Report 2011\/108"},{"key":"ref32","article-title":"Complete addition formulas for prime order elliptic curves","author":"renes","year":"2015","journal-title":"Cryptology ePrint Archive Report 2015\/1060"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"ref36","first-page":"420","article-title":"Fully homomorphic encryption with relatively small key and ciphertext sizes","volume":"6056","author":"smart","year":"2010","journal-title":"PKC 2010"},{"article-title":"NTL: A library for doing number theory, 2015. Version 9.4.0","year":"0","author":"shoup","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","article-title":"Batch fully homomorphic encryption over the integers","volume":"7881","author":"cheon","year":"2013","journal-title":"EUROCRYPT 2013"},{"key":"ref11","first-page":"142","article-title":"Search-and-compute on encrypted data","volume":"8976","author":"cheon","year":"2015","journal-title":"FC 2015 Workshops"},{"key":"ref12","first-page":"194","article-title":"Homomorphic computation of edit distance","volume":"8976","author":"cheon","year":"2015","journal-title":"FC 2015 Workshops"},{"key":"ref13","first-page":"261","author":"chevalier","year":"2016","journal-title":"Privately Outsourcing Exponentiation to a Single Server Cryptanalysis and Optimal Constructions"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053453"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_38"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","article-title":"Homomorphic evaluation of the AES circuit","volume":"7417","author":"gentry","year":"2012","journal-title":"CRYPTO 2012"},{"key":"ref18","first-page":"1","article-title":"ML confidential: Machine learning on encrypted data","volume":"7839","author":"graepel","year":"2013","journal-title":"ICISC 12"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","article-title":"Algorithms in HElib","volume":"8616","author":"halevi","year":"2014","journal-title":"CRYPTO 2014 Part I"},{"key":"ref28","first-page":"311","article-title":"Towards stream ciphers for efficient fhe with low-noise ciphertexts","author":"me\u00e9aux","year":"2016","journal-title":"Proceedings of the 35th Annual International Conference on Advances in Cryptology — EUROCRYPT 2016 - Volume 9665"},{"key":"ref4","first-page":"1","article-title":"Nist special publication 800-57","volume":"57","author":"barker","year":"0","journal-title":"NIST Special Publication 800-22"},{"key":"ref27","first-page":"497","article-title":"Speeding up secret computations with insecure auxiliary devices","volume":"403","author":"matsumoto","year":"1990","journal-title":"CRYPTO’88"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2014.04.003"},{"key":"ref29","first-page":"341","article-title":"NFLlib: NTT-based fast lattice library","volume":"9610","author":"melchor","year":"2016","journal-title":"CT-RSA 2016"},{"key":"ref5","first-page":"102","article-title":"Private database queries using somewhat homomorphic encryption","volume":"7954","author":"boneh","year":"2013","journal-title":"ACNS 13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref7","first-page":"221","article-title":"Speeding up discrete log and factoring based schemes via precomputations","volume":"1403","author":"boyko","year":"1998","journal-title":"EUROCRYPT’98"},{"key":"ref2","first-page":"103","article-title":"On dual lattice attacks against small-secret lwe and parameter choices in helib and seal","author":"albrecht","year":"2017","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47555-9_18"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230219"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/978-3-662-46800-5_25","article-title":"Bootstrapping for HElib","volume":"9056","author":"halevi","year":"2015","journal-title":"EUROCRYPT 2015 Part II"},{"key":"ref22","first-page":"264","article-title":"How to securely out-source cryptographic computations","volume":"3378","author":"hohenberger","year":"2005","journal-title":"TCC 2005"},{"journal-title":"Guide to Elliptic Curve Cryptography","year":"2003","author":"hankerson","key":"ref21"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-16295-9_1","article-title":"Private computation on encrypted genomic data","volume":"8895","author":"lauter","year":"2015","journal-title":"LATINCRYPT 2014"},{"key":"ref23","article-title":"The art of computer programming: Semi-numerical algorithms","volume":"2","author":"knuth","year":"1997"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_11"},{"key":"ref25","first-page":"318","volume":"8469","author":"lepoint","year":"2014","journal-title":"A Comparison of the Homomorphic Encryption Schemes FV and YASHE"}],"event":{"name":"2018 IEEE Conference on Communications and Network Security (CNS)","start":{"date-parts":[[2018,5,30]]},"location":"Beijing","end":{"date-parts":[[2018,6,1]]}},"container-title":["2018 IEEE Conference on Communications and Network Security (CNS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410986\/8433121\/08433140.pdf?arnumber=8433140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T05:56:00Z","timestamp":1720504560000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8433140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/cns.2018.8433140","relation":{},"subject":[],"published":{"date-parts":[[2018,5]]}}}