{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:44:50Z","timestamp":1757454290106},"reference-count":41,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T00:00:00Z","timestamp":1658620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Pairing-based cryptography is utilized in a wide range of devices, such as servers, mobile devices, smart cards and sensors. Pairing computation would be a burden for power and\/or computation-restricted devices. Protocols for outsourcing pairing computations from limited devices to more resourceful devices are already proposed. These protocols naturally require verification of the computation and secrecy of the inputs and\/or outputs. Similarly, batch pairing outsourcing protocols aim to improve efficiency over multiple runs of the state-of-the-art single pairing delegation protocols. Here, we will cover efficient, privacy preserving, secure batch pairing outsource protocols for each type based on secrecy of inputs and outputs. We propose the first generic outsourcing protocol where inputs and outputs of the pairing function are secret. In addition to this, we give some methods to avoid certain type of attacks, increase efficiency and get rid of pairing arithmetic. The proposed protocols enable limited devices to outsource pairing computations with only elliptic curve arithmetic.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac095","type":"journal-article","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T21:39:39Z","timestamp":1658612379000},"page":"2437-2446","source":"Crossref","is-referenced-by-count":3,"title":["On The Batch Outsourcing Of Pairing Computations"],"prefix":"10.1093","volume":"66","author":[{"given":"Oznur","family":"Kalkar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Institute of Natural and Applied Sciences, Gebze Technical University , Gebze , Turkey"},{"name":"MCS Labs & BCLabs, T\u00dcB\u0130TAK B\u0130LGEM UEKAE , PK. 74, 41470, Gebze , Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isa","family":"Sertkaya","sequence":"additional","affiliation":[{"name":"MCS Labs & BCLabs, T\u00dcB\u0130TAK B\u0130LGEM UEKAE , PK. 74, 41470, Gebze , Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seher","family":"Tutdere","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science and Letters, Balkesir University , Alteyll, Balkesir"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,7,24]]},"reference":[{"key":"2023101421211232400_ref1","doi-asserted-by":"crossref","first-page":"18209","DOI":"10.1109\/ACCESS.2018.2820162","article-title":"Data security and privacy-preserving in edge computing paradigm: survey and open issues","volume":"6","author":"Zhang","year":"2018","journal-title":"IEEE Access"},{"key":"2023101421211232400_ref2","first-page":"264","volume-title":"Proceedings of TCC 2005","author":"Hohenberger","year":"2005"},{"key":"2023101421211232400_ref3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/MNET.2018.1700345","article-title":"Secure outsourced computation in connected vehicular cloud computing","volume":"32","author":"Shao","year":"2018","journal-title":"IEEE Network"},{"key":"2023101421211232400_ref4","first-page":"24","volume-title":"Proceedings of CARDIS 2010","author":"Chevallier-Mames","year":"2010"},{"key":"2023101421211232400_ref5","article-title":"Efficient delegation of pairing computation","author":"Kang","year":"2005","journal-title":"Cryptology ePrint Archive."},{"key":"2023101421211232400_ref6","first-page":"549","volume-title":"Proceedings of ACNS 2014","author":"Canard","year":"2014"},{"key":"2023101421211232400_ref7","article-title":"More efficient secure outsourcing methods for bilinear maps","author":"Kalkar","year":"2015","journal-title":"Cryptology ePrint Archive."},{"key":"2023101421211232400_ref8","first-page":"155","volume-title":"Proceedings of IFIP International Conference on Information Security Theory and Practice","author":"Kalkar","year":"2017"},{"key":"2023101421211232400_ref9","article-title":"Fully verifiable secure delegation of pairing computation: cryptanalysis and an efficient construction","author":"Uzunkol","year":"2017","journal-title":"Cryptology ePrint Archive."},{"key":"2023101421211232400_ref10","first-page":"74","volume-title":"Proceedings of International Workshop on Security","author":"Tsang","year":"2007"},{"key":"2023101421211232400_ref11","article-title":"Verifiable outsourcing of pairing computations","author":"Mefenza","journal-title":"Technical report."},{"key":"2023101421211232400_ref12","doi-asserted-by":"crossref","DOI":"10.1201\/9781315370170","volume-title":"Guide to Pairing-Based Cryptography","author":"El Mrabet","year":"2017"},{"key":"2023101421211232400_ref13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-319-22174-8_14","volume-title":"Proceedings of LATINCRYPT 2015","author":"Barreto","year":"2015"},{"key":"2023101421211232400_ref14","first-page":"319","volume-title":"Proceedings of International workshop on selected areas in cryptography","author":"Barreto","year":"2005"},{"key":"2023101421211232400_ref15","first-page":"257","volume-title":"Proceedings of International conference on security in communication networks","author":"Barreto","year":"2002"},{"key":"2023101421211232400_ref16","first-page":"126","volume-title":"Proceedings of International conference on pairing-based cryptography","author":"Kachisa","year":"2008"},{"key":"2023101421211232400_ref17","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"Journal of the ACM (JACM)"},{"key":"2023101421211232400_ref18","first-page":"216","volume-title":"Proceedings of International symposium on symbolic and algebraic manipulation","author":"Zippel","year":"1979"},{"key":"2023101421211232400_ref19","first-page":"193","volume-title":"Proceedings of CARDIS 2014","author":"Guillevic","year":"2014"},{"key":"2023101421211232400_ref20","first-page":"45","volume-title":"Proceedings of ACNS 2020","author":"Crescenzo","year":"2020"},{"key":"2023101421211232400_ref21","first-page":"535","volume-title":"Proceedings of TCC 2007","author":"Boneh","year":"2007"},{"key":"2023101421211232400_ref22","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/SP.2007.29","volume-title":"Proceedings of 2007 IEEE Symposium on Security and Privacy (SP\u201907)","author":"Shi","year":"2007"},{"key":"2023101421211232400_ref23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/1180405.1180432","volume-title":"Proceedings of the 13th ACM conference on Computer and communications security","author":"Boneh","year":"2006"},{"key":"2023101421211232400_ref24","first-page":"445","volume-title":"Proceedings of EUROCRYPT 2006","author":"Gentry","year":"2006"},{"key":"2023101421211232400_ref25","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Proceedings of EUROCRYPT 2004","author":"Boneh","year":"2004"},{"key":"2023101421211232400_ref26","first-page":"219","volume-title":"Proceedings of 16th IEEE Computer Security Foundations Workshop","author":"Chen","year":"2003"},{"key":"2023101421211232400_ref27","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/SP.2007.11","volume-title":"Proceedings of 2007 IEEE symposium on security and privacy","author":"Bethencourt","year":"2007"},{"key":"2023101421211232400_ref28","first-page":"213","volume-title":"Proceedings of CRYPTO\u201901","author":"Boneh","year":"2001"},{"key":"2023101421211232400_ref29","volume-title":"Proceedings of SCIS2000","author":"Sakai","year":"2000"},{"key":"2023101421211232400_ref30","first-page":"508","volume-title":"Proceedings of PKC 2006","author":"Chow","year":"2006"},{"key":"2023101421211232400_ref31","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10207-008-0055-0","article-title":"A survey of certificateless encryption schemes and security models","volume":"7","author":"Dent","year":"2008","journal-title":"International Journal of Information Security"},{"key":"2023101421211232400_ref32","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1180405.1180418","volume-title":"Proceedings of the 13th ACM conference on Computer and communications security","author":"Goyal","year":"2006"},{"key":"2023101421211232400_ref33","first-page":"31","volume-title":"Proceedings of PKC 2003","author":"Boldyreva","year":"2003"},{"key":"2023101421211232400_ref34","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","article-title":"Short signatures without random oracles and the SDH assumption in bilinear groups","volume":"21","author":"Boneh","year":"2008","journal-title":"Journal of cryptology"},{"key":"2023101421211232400_ref35","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Proceedings of EUROCRYPT 2003","author":"Boneh","year":"2003"},{"key":"2023101421211232400_ref36","first-page":"262","volume-title":"Proceedings of PKC 2004","author":"Baek","year":"2004"},{"key":"2023101421211232400_ref37","first-page":"170","volume-title":"Proceedings of International Workshop on Information Security Applications","author":"Chow","year":"2004"},{"key":"2023101421211232400_ref38","first-page":"213","article-title":"Identity-based encryption from the Weil pairing","volume-title":"Proceedings of CRYPTO\u201901","author":"Boneh","year":"2001"},{"key":"2023101421211232400_ref39","volume-title":"Proceedings of PKC 2007","author":"Boyen","year":"2007"},{"key":"2023101421211232400_ref40","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/1030083.1030130","volume-title":"Proceedings of the 11th ACM conference on Computer and communications security","author":"Yao","year":"2004"},{"key":"2023101421211232400_ref41","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","article-title":"Updating key size estimations for pairings","volume":"32","author":"Barbulescu","year":"2019","journal-title":"Journal of cryptology"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/10\/2437\/52134666\/bxac095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/10\/2437\/52134666\/bxac095.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T21:21:52Z","timestamp":1697318512000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/10\/2437\/6649280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,24]]},"references-count":41,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,7,24]]},"published-print":{"date-parts":[[2023,10,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac095","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,10]]},"published":{"date-parts":[[2022,7,24]]}}}