{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:21:51Z","timestamp":1763457711631,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004584","name":"Conseil R\u00e9gional de Bretagne","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004584","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13389-018-0192-y","type":"journal-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T09:16:00Z","timestamp":1529313360000},"page":"185-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Design and implementation of low-depth pairing-based homomorphic encryption scheme"],"prefix":"10.1007","volume":"9","author":[{"given":"Vincent","family":"Herbert","sequence":"first","affiliation":[]},{"given":"Bhaskar","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Caroline","family":"Fontaine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"192_CR1","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10\u201312, 2005, Proceedings, Volume 3378 of Lecture Notes in Computer Science, pp. 325\u2013341. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"192_CR2","doi-asserted-by":"crossref","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings, Volume 6110 of Lecture Notes in Computer Science, pp. 44\u201361. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"192_CR3","unstructured":"Catalano, D., Fiore, D.: Using linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. In: Ray, I., Li, N., Kruegel, C. (eds.) Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12\u201316, 2015, pp. 1518\u20131529. ACM (2015)"},{"key":"192_CR4","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Advances in Cryptology EUROCRYPT 1999, Number 1592 in LNCS, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"4","key":"192_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"192_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The decision Diffie\u2013Hellman problem. In: Proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, London, UK, pp. 48\u201363. Springer (1998)","DOI":"10.1007\/BFb0054851"},{"key":"192_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781315370170","volume-title":"Guide to Pairing-Based Cryptography","author":"N El Mrabet","year":"2017","unstructured":"El Mrabet, N., Joye, M.: Guide to Pairing-Based Cryptography. CRC Press, Boca Raton (2017)"},{"key":"192_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1142\/S0219493709002610","volume":"9","author":"C Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. STOC 9, 169\u2013178 (2009)","journal-title":"STOC"},{"key":"192_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"1","key":"192_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TIFS.2008.2011087","volume":"4","author":"T Bianchi","year":"2009","unstructured":"Bianchi, T., Piva, A., Barni, M.: On the implementation of the discrete Fourier transform in the encrypted domain. IEEE Trans. Inf. Forensics Secur. 4(1), 86\u201397 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"192_CR11","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Gaborit, P., Herranz, J.: Additively homomorphic encryption with d-operand multiplications. In: Advances in Cryptology\u2014CRYPTO 2010, pp. 138\u2013154. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_8"},{"key":"192_CR12","doi-asserted-by":"crossref","unstructured":"Lauter, K., L\u00f3pez-Alt, A., Naehrig, M.: Private computation on encrypted genomic data. In: International Conference on Cryptology and Information Security in Latin America, pp. 3\u201327. Springer (2014)","DOI":"10.1007\/978-3-319-16295-9_1"},{"key":"192_CR13","doi-asserted-by":"crossref","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Advances in cryptology\u2014EUROCRYPT 2010, pp. 24\u201343. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"192_CR14","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: International Workshop on Public Key Cryptography, pp. 420\u2013443. Springer (2010)","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"192_CR15","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: ACM CCSW, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"192_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Advances in Cryptology\u2014EUROCRYPT 2012, pp. 465\u2013482. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"192_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 107\u2013109. IEEE (2011)","DOI":"10.1109\/FOCS.2011.94"},{"key":"192_CR18","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2012, pp. 446\u2013464. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"192_CR19","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"192_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2014CRYPTO 2013, pp. 75\u201392. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"192_CR21","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: International Conference On Cryptography and Coding. Springer (December 2013)","DOI":"10.1007\/978-3-642-45239-0_4"},{"issue":"3","key":"192_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) Fully homomorphic encryption without bootstrapping. TOCT 6(3), 13 (2014)","journal-title":"TOCT"},{"key":"192_CR23","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science\u2014ITCS 2014, pp. 1\u201312. ACM (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"192_CR24","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.1109\/TC.2015.2500576","volume":"65","author":"A Khedr","year":"2015","unstructured":"Khedr, A., Gulak, G., Vaikuntanathan, V.: SHIELD: scalable homomorphic implementation of encrypted data-classifiers. IEEE Trans. Comput. 65, 2848\u20132858 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"192_CR25","unstructured":"Dor\u00f6z, Y., Sunar, B.: Flattening NTRU for evaluation key free homomorphic encryption. Cryptology ePrint Archive, Report 2016\/315 (2016)"},{"key":"192_CR26","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Advances in Cryptology\u2014ASIACRYPT 2016\u201422nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4\u20138, 2016, Proceedings, Part I, pp. 3\u201333 (2016)"},{"key":"192_CR27","first-page":"422","volume":"2008","author":"F Armknecht","year":"2008","unstructured":"Armknecht, F., Sadeghi, A.-R.: A new approach for algebraically homomorphic encryption. IACR Cryptol. ePrint Arch. 2008, 422 (2008)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"192_CR28","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed\u2013Solomon and algebraic-geometric codes. In: 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings, pp. 28\u201337. IEEE (1998)"},{"key":"192_CR29","doi-asserted-by":"crossref","unstructured":"Augot, D., Finiasz, M.: A public key encryption scheme based on the polynomial reconstruction problem. In: Advances in Cryptology\u2014EUROCRYPT 2003, pp. 645\u2013645 (2003)","DOI":"10.1007\/3-540-39200-9_14"},{"issue":"5","key":"192_CR30","first-page":"978","volume":"87","author":"A Kiayias","year":"2004","unstructured":"Kiayias, A., Yung, M.: Directions in polynomial reconstruction based cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87(5), 978\u2013985 (2004)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"6","key":"192_CR31","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"192_CR32","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: Advances in Cryptology\u2014EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings, Chapter On Ideal Lattices and Learning with Errors over Rings, pp. 1\u201323. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"192_CR33","unstructured":"Guillevic, A.: Arithmetic of pairings on algebraic curves for cryptography. Theses, Ecole Normale Sup\u00e9rieure de Paris - ENS Paris (December 2013)"},{"key":"192_CR34","doi-asserted-by":"crossref","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Applied Cryptography and Network Security\u201411th International Conference, ACNS 2013, Banff, AB, Canada, June 25\u201328, 2013. Proceedings, pp. 357\u2013372 (2013)","DOI":"10.1007\/978-3-642-38980-1_22"},{"issue":"2","key":"192_CR35","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2009","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2009)","journal-title":"J. Cryptol."},{"key":"192_CR36","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) Progress in Cryptology\u2014LATINCRYPT 2010, First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, August 8\u201311, 2010, Proceedings, Volume 6212 of Lecture Notes in Computer Science, pp. 109\u2013123. Springer (2010)","DOI":"10.1007\/978-3-642-14712-8_7"},{"issue":"1","key":"192_CR37","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"192_CR38","doi-asserted-by":"crossref","unstructured":"Enge, A., Milan, J.: Security, Privacy, and Applied Cryptography Engineering: 4th International Conference, SPACE 2014, Pune, India, October 18\u201322, 2014. Proceedings, Chapter Implementing Cryptographic Pairings at Standard Security Levels, pp. 28\u201346. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12060-7_3"},{"issue":"6","key":"192_CR39","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TDSC.2015.2507120","volume":"14","author":"R Azarderakhsh","year":"2017","unstructured":"Azarderakhsh, R., Fishbein, D., Grewal, G., Hu, S., Jao, D., Longa, P., Verma, R.: Fast software implementations of bilinear pairings. IEEE Trans. Dependable Secur. Comput. 14(6), 605\u2013619 (2017)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"192_CR40","first-page":"362","volume":"2013","author":"S Mitsunari","year":"2013","unstructured":"Mitsunari, S.: A fast implementation of the optimal ate pairing over BN curve on intel haswell processor. IACR Cryptol. ePrint Arch. 2013, 362 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"192_CR41","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Barreto, P.S.L.M., Longa, P., Ricardini, J.E.: The realm of the pairings. In: International Conference on Selected Areas in Cryptography, pp. 3\u201325. Springer (2013)","DOI":"10.1007\/978-3-662-43414-7_1"},{"issue":"5","key":"192_CR42","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1109\/TC.2014.2329681","volume":"64","author":"E Zavattoni","year":"2015","unstructured":"Zavattoni, E., Perez, L.J.D., Mitsunari, S., S\u00e1nchez-Ram\u00ed-rez, A.H., Teruya, T., Rodr\u00ed-guez-Henr\u00ed-quez, F.: Software implementation of an attribute-based encryption scheme. IEEE Trans. Comput. 64(5), 1429\u20131441 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"192_CR43","first-page":"68","volume-title":"Somewhat\/Fully Homomorphic Encryption: Implementation Progresses and Challenges","author":"G Bonnoron","year":"2017","unstructured":"Bonnoron, G., Fontaine, C., Gogniat, G., Herbert, V., Lap\u00f4tre, V., Migliore, V., Roux-Langlois, A.: Somewhat\/Fully Homomorphic Encryption: Implementation Progresses and Challenges, pp. 68\u201382. Springer, Cham (2017)"},{"key":"192_CR44","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions: cryptanalysis of some FHE and Graded Encoding Schemes. Cryptology ePrint Archive, Report 2016\/127 (2016)","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"192_CR45","unstructured":"Kirchner, P., Fouque, P.-A.: Comparison between Subfield and Straightforward Attacks on NTRU. Cryptology ePrint Archive, 2016\/717 (2016)"},{"key":"192_CR46","unstructured":"Migliore, V., Bonnoron, G., Fontaine, C.: Determination and exploration of practical parameters for the latest Somewhat Homomorphic Encryption (SHE) Schemes. Working paper or preprint (October 2016)"},{"key":"192_CR47","unstructured":"Aguilar-Melchor, C.: Private Communication"},{"key":"192_CR48","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Player, R.: Simple encrypted arithmetic library-seal v2. 1. IACR Cryptology ePrint Archive, 2017:224 (2017)","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"192_CR49","first-page":"108","volume":"2007","author":"S Galbraith","year":"2007","unstructured":"Galbraith, S., Hess, F., Vercauteren, F.: Hyperelliptic pairings. Pair. Based Cryptogr. Pair. 2007, 108\u2013131 (2007)","journal-title":"Pair. Based Cryptogr. Pair."},{"key":"192_CR50","doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Annual Cryptology Conference, pp. 543\u2013571. Springer (2016)","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"192_CR51","first-page":"294","volume":"2007","author":"L Hitt","year":"2007","unstructured":"Hitt, L.: On the minimal embedding field. Pair. Based Cryptogr. Pair. 2007, 294\u2013301 (2007)","journal-title":"Pair. Based Cryptogr. Pair."},{"key":"192_CR52","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: The Development of the Number Field Sieve, pp. 11\u201342. Springer (1993)","DOI":"10.1007\/BFb0091537"},{"key":"192_CR53","doi-asserted-by":"crossref","unstructured":"Menezes, A., Sarkar, P., Singh, S.: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. In: Proceedings of Mycrypt (2016)","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"192_CR54","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. Cryptology ePrint Archive, Report 2017\/334, (2017). \n                    http:\/\/eprint.iacr.org\/2017\/334"},{"key":"192_CR55","unstructured":"Duquesne, S., El Mrabet, N., Haloui, S., Rondepierre, F.: Choosing and generating parameters for low level pairing implementation on BN curves (2015)"},{"key":"192_CR56","doi-asserted-by":"crossref","unstructured":"Khandaker, Md.A.-A., Nanjo, Y., Ghammam, L., Duquesne, S., Nogami, Y., Kodera, Y.: Efficient optimal ate pairing at 128-bit security level. In: International Conference in Cryptology in India, pp. 186\u2013205. Springer (2017)","DOI":"10.1007\/978-3-319-71667-1_10"},{"key":"192_CR57","unstructured":"Aranha, D.: Pairings are not dead, just resting. 21st Workshop on Elliptic Curve Cryptography, \n                    https:\/\/ecc2017.cs.ru.nl\/slides\/ecc2017-aranha.pdf\n                    \n                   (November 2017)"},{"key":"192_CR58","doi-asserted-by":"crossref","unstructured":"Che, H., Han, K., Zhicong, H., Jalali, A., Laine, K.: Simple Encrypted Arithmetic Library\u2014SEAL (v2.3.0). Technical report (December 2017)","DOI":"10.1007\/978-3-319-70278-0_1"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0192-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-0192-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0192-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T19:23:59Z","timestamp":1560799439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-0192-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["192"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-0192-y","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"4 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}