{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:58:41Z","timestamp":1783562321867,"version":"3.55.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019127","type":"print"},{"value":"9783032019134","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01913-4_7","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:43Z","timestamp":1755332563000},"page":"211-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["That\u2019s AmorE: Amortized Efficiency for\u00a0Pairing Delegation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3634-3439","authenticated-orcid":false,"given":"Adri\u00e1n P.","family":"Keilty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2457-0783","authenticated-orcid":false,"given":"Diego F.","family":"Aranha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7804-6696","authenticated-orcid":false,"given":"Elena","family":"Pagnin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5916-6625","authenticated-orcid":false,"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Ambrona, M., Beunardeau, M., Schmitt, A.L., Toledo, R.R.: aPlonK: aggregated PlonK from multi-polynomial commitment schemes. In: Shikata, J., Kuzuno, H. (eds.) IWSEC 2023. LNCS, vol. 14128, pp. 195\u2013213. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-41326-1_11","DOI":"10.1007\/978-3-031-41326-1_11"},{"issue":"3","key":"7_CR2","first-page":"3","volume":"1","author":"DF Aranha","year":"2024","unstructured":"Aranha, D.F., Fotiadis, G., Guillevic, A.: A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level. IACR Commun. Cryptol. 1(3), 3 (2024)","journal-title":"IACR Commun. Cryptol."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-88238-9_16","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2021","author":"DF Aranha","year":"2021","unstructured":"Aranha, D.F., Pagnin, E., Rodr\u00edguez-Henr\u00edquez, F.: LOVE a Pairing. In: Longa, P., R\u00e0fols, C. (eds.) LATINCRYPT 2021. LNCS, vol. 12912, pp. 320\u2013340. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88238-9_16"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.: Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6), 1668\u20131680 (2002). https:\/\/doi.org\/10.1109\/TIT.2002.1003845","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-24582-7_15","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"R Barua","year":"2003","unstructured":"Barua, R., Dutta, R., Sarkar, P.: Extending Joux\u2019s protocol to multi party key agreement (extended abstract). In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 205\u2013217. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_15"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_3"},{"key":"7_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":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-03329-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 435\u2013464. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_15"},{"key":"7_CR10","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":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. J. Cryptol. 17(4), 297\u2013319 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0314-9","journal-title":"J. Cryptol."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-03810-6_3","volume-title":"Theory of Cryptography","author":"M Campanelli","year":"2018","unstructured":"Campanelli, M., Gennaro, R.: Fine-grained secure computation. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 66\u201397. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_3"},{"key":"7_CR14","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":"7_CR15","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Giunta, E.: Efficient and universally composable single secret leader election from pairings. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 471\u2013499. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_17","DOI":"10.1007\/978-3-031-31368-4_17"},{"key":"7_CR16","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":"7_CR17","doi-asserted-by":"publisher","unstructured":"Crescenzo, G.D., Khodjaeva, M., Caro, D.D.M.: Single-server batch delegation of variable-input pairings with unbounded client lifetime. In: Katsikas, S., et al. (eds.) ESORICS 2023. LNCS, vol. 14399, pp. 233\u2013255. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-54129-2_14","DOI":"10.1007\/978-3-031-54129-2_14"},{"key":"7_CR18","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":"7_CR19","unstructured":"Hopwood, D.E., Sean\u00a0Bowe, T.H., Wilcox, N.: Zcash protocol specification, December 2023. https:\/\/github.com\/zcash\/zips\/blob\/main\/protocol\/protocol.pdf"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: Exhaustive cryptanalysis of the NBS data encryption standard. COMPUTER, pp. 74\u201384 (1977)","DOI":"10.1109\/C-M.1977.217750"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"YZ Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1\u201326. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_1"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Gailly, N., Maller, M., Nitulescu, A.: SnarkPack: practical SNARK aggregation. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 203\u2013229. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_10","DOI":"10.1007\/978-3-031-18283-9_10"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: Hints: threshold signatures with silent setup. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 3034\u20133052. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00057"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/11593447_33","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Girault","year":"2005","unstructured":"Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605\u2013623. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_33"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"7_CR28","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":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11787006_17","volume-title":"Automata, Languages and Programming","author":"D Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On everlasting security in the Hybrid bounded storage model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 192\u2013203. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_17"},{"key":"7_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-17433-9_22","volume-title":"AFRICACRYPT","author":"YE Housni","year":"2022","unstructured":"Housni, Y.E., Guillevic, A., Piellard, T.: Co-factor clearing and subgroup membership testing on pairing-friendly curves. In: Batina, L., Daemen, J. (eds.) AFRICACRYPT 2022. LNCS, vol. 13503, pp. 518\u2013536. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17433-9_22"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) Algorithmic Number Theory \u2013 ANTS IV, pp. 385\u2013394. No.\u00a01838. LNCS. Springer (2000)","DOI":"10.1007\/10722028_23"},{"issue":"10","key":"7_CR32","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1093\/comjnl\/bxac095","volume":"66","author":"O Kalkar","year":"2023","unstructured":"Kalkar, O., Sertkaya, I., Tutdere, S.: On the batch outsourcing of pairing computations. Comput. J. 66(10), 2437\u20132446 (2023)","journal-title":"Comput. J."},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-75551-7_7","volume-title":"Privacy Enhancing Technologies","author":"A Kate","year":"2007","unstructured":"Kate, A., Zaverucha, G., Goldberg, I.: Pairing-based onion routing. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 95\u2013112. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75551-7_7"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Keilty, A.P., Aranha, D.F., Pagnin, E., Rodr\u00edguez-Henr\u00edquez, F.: That\u2019s AmorE: Amortized efficiency for pairing delegation. Cryptology ePrint Archive, Paper 2025\/542 (2025). https:\/\/eprint.iacr.org\/2025\/542","DOI":"10.1007\/978-3-032-01913-4_7"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Khodjaeva., M., Di Crescenzo., G.: On single-server delegation without precomputation. In: Proceedings of the 20th International Conference on Security and Cryptography - SECRYPT, pp. 540\u2013547. INSTICC, SciTePress (2023). https:\/\/doi.org\/10.5220\/0012140100003555","DOI":"10.5220\/0012140100003555"},{"issue":"1","key":"7_CR37","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1504\/IJACT.2020.107167","volume":"4","author":"NM Mbang","year":"2020","unstructured":"Mbang, N.M., Aranha, D.F., Fouotsa, E.: Computing the Optimal Ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. Int. J. Appl. Cryptogr. 4(1), 45\u201359 (2020)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"7_CR38","unstructured":"Mefenza, T., Vergnaud, D.: Verifiable outsourcing of pairing computations (2018). https:\/\/tinyurl.com\/Batch-Mefenza-Pairings"},{"key":"7_CR39","unstructured":"Novakovic, A., Eagen, L.: On proving pairings. Cryptology ePrint Archive (2024)"},{"issue":"2","key":"7_CR40","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2856449","volume":"59","author":"B Parno","year":"2016","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016)","journal-title":"Commun. ACM"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"key":"7_CR42","unstructured":"Sakai, R., Oghishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS2000), Okinawa, Japan, pp. 26\u201328, January 2000"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M Scott","year":"2011","unstructured":"Scott, M.: On the efficient implementation of pairing-based protocols. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 296\u2013308. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25516-8_18"},{"key":"7_CR44","unstructured":"Scott, M.: Unbalancing pairing-based key exchange protocols. Cryptology ePrint Archive, Paper 2013\/688 (2013). https:\/\/eprint.iacr.org\/2013\/688"},{"issue":"3","key":"7_CR45","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MNET.2018.1700345","volume":"32","author":"J Shao","year":"2018","unstructured":"Shao, J., Wei, G.: Secure outsourced computation in connected vehicular cloud computing. IEEE Network 32(3), 36\u201341 (2018)","journal-title":"IEEE Network"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-75651-4_6","volume-title":"Advances in Information and Computer Security","author":"PP Tsang","year":"2007","unstructured":"Tsang, P.P., Chow, S.S.M., Smith, S.W.: Batch pairing delegation. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol. 4752, pp. 74\u201390. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75651-4_6"},{"issue":"5","key":"7_CR47","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\u00edrez, A.H., Teruya, T., Rodr\u00edguez-Henr\u00edquez, F.: Software implementation of an attribute-based encryption scheme. IEEE Trans. Comput. 64(5), 1429\u20131441 (2015)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01913-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:56:51Z","timestamp":1757429811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}