{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:34:26Z","timestamp":1757457266138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031541285"},{"type":"electronic","value":"9783031541292"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54129-2_14","type":"book-chapter","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T22:03:15Z","timestamp":1710194595000},"page":"233-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Single-Server Batch Delegation of\u00a0Variable-Input Pairings with\u00a0Unbounded Client Lifetime"],"prefix":"10.1007","author":[{"given":"Giovanni Di","family":"Crescenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matluba","family":"Khodjaeva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilan D. Morales","family":"Caro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M Abadi","year":"1989","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On Hiding Information from an Oracle. J. Comput. Syst. Sci. 39(1), 21\u201350 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s11704-016-6148-4","volume":"12","author":"H Ahmad","year":"2018","unstructured":"Ahmad, H., et al.: Primitives towards verifiable computation: a survey. In Front. Comput. Sci. 12(3), 451\u2013478 (2018)","journal-title":"In Front. Comput. Sci."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-40061-5_29","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"SS Al-Riyami","year":"2003","unstructured":"Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452\u2013473. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_29"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-22174-8_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"PSLM Barreto","year":"2015","unstructured":"Barreto, P.S.L.M., Costello, C., Misoczki, R., Naehrig, M., Pereira, G.C.C.F., Zanon, G.: Subgroup security in pairing-based cryptography. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236\u2013250. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054130"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440\u2013456. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_26"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-07536-5_32","volume-title":"Applied Cryptography and Network Security","author":"S Canard","year":"2014","unstructured":"Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 549\u2013565. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_32"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-12510-2_3","volume-title":"Smart Card Research and Advanced Application","author":"B Chevallier-Mames","year":"2010","unstructured":"Chevallier-Mames, B., Coron, J.-S., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: Gollmann, D., Lanet, J.-L., Iguchi-Cartigny, J. (eds.) CARDIS 2010. LNCS, vol. 6035, pp. 24\u201335. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12510-2_3"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: A Survey on Delegated Computation. In: Diekert, V., Volkov, M. (eds) Developments in Language Theory. DLT 2022. Lecture Notes in Computer Science, vol. 13257. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_3","DOI":"10.1007\/978-3-031-05578-2_3"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-57808-4_3","volume-title":"Applied Cryptography and Network Security","author":"G Di Crescenzo","year":"2020","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure and efficient delegation of elliptic-curve pairing. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 45\u201366. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_3"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-68487-7_6","volume-title":"Smart Card Research and Advanced Applications","author":"G Di Crescenzo","year":"2021","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure and efficient delegation of\u00a0pairings with online inputs. In: Liardet, P.-Y., Mentens, N. (eds.) CARDIS 2020. LNCS, vol. 12609, pp. 84\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68487-7_6"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J.: Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? In: Proc. of CRYPTO, pp. 477\u2013488 (1985)","DOI":"10.1007\/3-540-39799-X_38"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Fiat, A.: Batch RSA. In Journal of Cryptology, v. 10, n. 2 (1997)","DOI":"10.1007\/s001459900021"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"M. Girault, D. Lefranc, Server-aided verification: Theory and practice. In: Roy, B.K. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605\u2013623. https:\/\/doi.org\/10.1007\/11593447_33","DOI":"10.1007\/11593447_33"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of ACM CCS 2006, pp. 89\u201398. ACM","DOI":"10.1145\/1180405.1180418"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-16763-3_12","volume-title":"Smart Card Research and Advanced Applications","author":"A Guillevic","year":"2015","unstructured":"Guillevic, A., Vergnaud, D.: Algorithms for Outsourcing Pairing Computation. In: Joye, M., Moradi, A. (eds.) CARDIS 2014. LNCS, vol. 8968, pp. 193\u2013211. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16763-3_12"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg K., Heys H. (eds) Selected Areas in Cryptography. SAC 2002","DOI":"10.1007\/3-540-36492-7_20"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264\u2013282. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_15"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Proceedings of ANTS 2000, pp. 385\u2013394","DOI":"10.1007\/10722028_23"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing brezing-weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_9"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Kalkar, O., Sertkaya, I., Tutdere, S.: On the batch outsourcing of pairing computations. Comput. J. (2022)","DOI":"10.1093\/comjnl\/bxac095"},{"key":"14_CR26","unstructured":"Kang, B.G., Lee, M.S., Park, J.H.: Efficient delegation of pairing computation. In: IACR Cryptology ePrint Archive, n. 259 (2005)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Khodjaeva, M., Di Crescenzo, G.: On single-server delegation without precomputation. In: Proceedings of SECRYPT 2023, pp. 540\u2013547. Scitepress","DOI":"10.5220\/0012140100003555"},{"key":"14_CR28","unstructured":"Kumar, S., Hu, Y., Andersen, M.P., Popa, R.A., Culler, D.E.: JEDI: many-to-many end-to-end encryption and key delegation for IoT. In: USENIX Security Symposium 2019, pp. 1519\u20131536 (2019)"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Liu, J.K., Au, M.H., Susilo, W.: Self-generated-certificate public-key cryptography and certificateless signature\/encryption scheme in the standard model. In: Proceedings of ACM Symposium on Information, Computer and Communications Security. ACM Press (2007)","DOI":"10.1145\/1229285.1266994"},{"key":"14_CR30","unstructured":"T. Matsumoto, K. Kato, H. Imai, An improved algorithm for secure outsourcing of modular exponentiations. In: Proc. of CRYPTO 1988, pp. 497\u2013506. LNCS. Springer"},{"key":"14_CR31","unstructured":"Mefenza, T., Vergnaud, D.: Verifiable outsourcing of pairing computations, Technical report (2018)"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.6028\/jres.120.002","volume":"120","author":"D Moody","year":"2015","unstructured":"Moody, D., Peralta, R., Perlner, R., Regenscheid, A., Roginsky, A., Chen, L.: Report on Pairing-based Cryptography. J. Res. Natl. Inst. Stand. Technol. 120, 11\u201327 (2015)","journal-title":"J. Res. Natl. Inst. Stand. Technol."},{"key":"14_CR33","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L., Markmann, T., Wahby, R.S., Liao, K.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"14_CR34","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security (SCIS) (2000)"},{"key":"14_CR35","unstructured":"Scott, M.: Unbalancing pairing-based key exchange protocols. In: IACR Cryptology ePrint Archive, n. 688 (2013)"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Shan, Z., Ren, K., Blanton, M., Wang, C.: Practical secure computation outsourcing: a survey. ACM Comput. Surv. 51(2), 31:1\u201331:40 (2018)","DOI":"10.1145\/3158363"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"P. Tsang, S. Chow, and S. Smith Batch pairing delegation. In: Proceedings of International Workshop on Security, 2007, pp. 74\u201390. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-75651-4_6","DOI":"10.1007\/978-3-540-75651-4_6"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","DOI":"10.1109\/TIT.2009.2034881"}],"container-title":["Lecture Notes in Computer Science","Computer Security. ESORICS 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54129-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T22:05:29Z","timestamp":1710194729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54129-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031541285","9783031541292"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54129-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"478","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}