{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T02:04:59Z","timestamp":1773108299508,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":53,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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-981-96-0888-1_13","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:12:48Z","timestamp":1733821968000},"page":"397-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tightly Secure Non-interactive BLS Multi-signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7037-2458","authenticated-orcid":false,"given":"Renas","family":"Bacho","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-7264","authenticated-orcid":false,"given":"Benedikt","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Alper, H.K., Burdges, J.: Two-round trip schnorr multi-signatures via delinearized witnesses. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 157\u2013188. Springer, Heidelberg, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_7","DOI":"10.1007\/978-3-030-84242-0_7"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022. pp. 193\u2013207. ACM Press (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3560656","DOI":"10.1145\/3548606.3560656"},{"key":"13_CR3","unstructured":"Bacho, R., Wagner, B.: Tightly secure non-interactive BLS multi-signatures. Cryptology ePrint Archive, Paper 2024\/1368 (2024), https:\/\/eprint.iacr.org\/2024\/1368"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bader, C., Jager, T., Li, Y., Sch\u00e4ge, S.: On the impossibility of tight cryptographic reductions. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 273\u2013304. Springer, Heidelberg (May 2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_10","DOI":"10.1007\/978-3-662-49896-5_10"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008. pp. 449\u2013458. ACM Press (Oct 2008). https:\/\/doi.org\/10.1145\/1455770.1455827","DOI":"10.1145\/1455770.1455827"},{"key":"13_CR6","unstructured":"Baldimtsi, F., Chalkias, K.K., Garillot, F., Lindstrom, J., Riva, B., Roy, A., Sedaghat, M., Sonnino, A., Waiwitlikhit, P., Wang, J.: Subset-optimized bls multi-signature with key aggregation. Cryptology ePrint Archive, Paper 2023\/498 (2023), https:\/\/eprint.iacr.org\/2023\/498, https:\/\/eprint.iacr.org\/2023\/498"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Dai, W.: Chain reductions for multi-signatures and the HBMS scheme. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT\u00a02021, Part\u00a0IV. LNCS, vol. 13093, pp. 650\u2013678. Springer, Heidelberg (Dec 2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_22","DOI":"10.1007\/978-3-030-92068-5_22"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Unrestricted aggregate signatures. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 411\u2013422. Springer, Heidelberg (Jul 2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_37","DOI":"10.1007\/978-3-540-73420-8_37"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006. pp. 390\u2013399. ACM Press (Oct\u00a0\/\u00a0Nov 2006).https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"13_CR10","unstructured":"Blockchain, H.: Harmony \u2013 Creating A Validator. https:\/\/docs.harmony.one\/home\/network\/validators\/creating-a-validator (2022), accessed: 2024-05-07"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Blum, E., Leung, D., Loss, J., Katz, J., Rabin, T.: Analyzing the real-world security of the algorand blockchain. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023. pp. 830\u2013844. ACM Press (Nov 2023). https:\/\/doi.org\/10.1145\/3576915.3623167","DOI":"10.1145\/3576915.3623167"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC\u00a02003. LNCS, vol.\u00a02567, pp. 31\u201346. Springer, Heidelberg (Jan 2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3","DOI":"10.1007\/3-540-36288-6_3"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyen, X., Goh, E.J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT\u00a02005. LNCS, vol.\u00a03494, pp. 440\u2013456. Springer, Heidelberg (May 2005). https:\/\/doi.org\/10.1007\/11426639_26","DOI":"10.1007\/11426639_26"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0II. LNCS, vol. 11273, pp. 435\u2013464. Springer, Heidelberg (Dec 2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_15","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT\u00a02003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (May 2003).https:\/\/doi.org\/10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"13_CR16","unstructured":"Boneh, D., Gorbunov, S., Wahby, R.S., Wee, H., Wood, C.A., Zhang, Z.: BLS Signatures. Internet-Draft draft-irtf-cfrg-bls-signature-05, Internet Engineering Task Force (Jun 2022), https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-bls-signature\/05\/, work in Progress"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (Dec 2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: Lattice-based multi-signature with single-round online phase. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 276\u2013305. Springer, Heidelberg (Aug 2022).https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10","DOI":"10.1007\/978-3-031-15979-4_10"},{"key":"13_CR19","unstructured":"contributors, C.: Chia network: Implementation of bls signatures. GitHub repository (Nov 2022), https:\/\/github.com\/Chia-Network\/node-chia-bls, the green cryptocurrency with Chialisp"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Coron, J.S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO\u00a02000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (Aug 2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14","DOI":"10.1007\/3-540-44598-6_14"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Coron, J.S.: Optimal security proofs for PSS and other signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT\u00a02002. LNCS, vol.\u00a02332, pp. 272\u2013287. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_18","DOI":"10.1007\/3-540-46035-7_18"},{"key":"13_CR22","unstructured":"Crites, E., Komlo, C., Maller, M.: How to prove schnorr assuming schnorr: Security of multi- and threshold signatures. Cryptology ePrint Archive, Report 2021\/1375 (2021), https:\/\/eprint.iacr.org\/2021\/1375"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 99\u2013130. Springer, Heidelberg (May 2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_5","DOI":"10.1007\/978-3-030-75245-3_5"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Drijvers, M., Edalatnejad, K., Ford, B., Kiltz, E., Loss, J., Neven, G., Stepanovs, I.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy. pp. 1084\u20131101. IEEE Computer Society Press (May 2019). https:\/\/doi.org\/10.1109\/SP.2019.00050","DOI":"10.1109\/SP.2019.00050"},{"key":"13_CR25","unstructured":"Drijvers, M., Gorbunov, S., Neven, G., Wee, H.: Pixel: Multi-signatures for consensus. In: Capkun, S., Roesner, F. (eds.) USENIX Security 2020. pp. 2093\u20132110. USENIX Association (Aug 2020)"},{"key":"13_CR26","unstructured":"Edgington, B.: Upgrading Ethereum - A technical handbook on Ethereum\u2019s move to proof of stake and beyond. Edition 0.3: Capella [wip] edn. (2023), https:\/\/eth2book.info\/capella\/part3\/helper\/crypto\/#bls-signatures"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992, pp. 33\u201362. Springer, Heidelberg (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Fukumitsu, M., Hasegawa, S.: A tightly secure ddh-based multisignature with public-key aggregation. In: 2020 Eighth International Symposium on Computing and Networking Workshops (CANDARW). pp. 321\u2013327 (2020). https:\/\/doi.org\/10.1109\/CANDARW51189.2020.00069","DOI":"10.1109\/CANDARW51189.2020.00069"},{"key":"13_CR29","unstructured":"Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Cryptology ePrint Archive, Report 2006\/165 (2006), https:\/\/eprint.iacr.org\/2006\/165"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: Scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles. p. 51\u201368. SOSP \u201917, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3132747.3132757, https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Goh, E.J., Jarecki, S., Katz, J., Wang, N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology 20(4), 493\u2013514 (Oct 2007). https:\/\/doi.org\/10.1007\/s00145-007-0549-3","DOI":"10.1007\/s00145-007-0549-3"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281\u2013308 (Apr 1988)","DOI":"10.1137\/0217017"},{"key":"13_CR33","unstructured":"Inc., C.N.: Chialisp primer: 5. bls signatures (2024), https:\/\/chialisp.com\/chialisp-bls-signatures\/"},{"key":"13_CR34","unstructured":"Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development (71), \u00a01\u20138 (1983)"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Kakvi, S.A., Kiltz, E.: Optimal security proofs for full domain hash, revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 537\u2013553. Springer, Heidelberg (Apr 2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_32","DOI":"10.1007\/978-3-642-29011-4_32"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: Jajodia, S., Atluri, V., Jaeger, T. (eds.) ACM CCS 2003. pp. 155\u2013164. ACM Press (Oct 2003). https:\/\/doi.org\/10.1145\/948109.948132","DOI":"10.1145\/948109.948132"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Langford, S.K.: Weakness in some threshold cryptosystems. In: Koblitz, N. (ed.) CRYPTO\u201996. LNCS, vol.\u00a01109, pp. 74\u201382. Springer, Heidelberg (Aug 1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_6","DOI":"10.1007\/3-540-68697-5_6"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Li, C.M., Hwang, T., Lee, N.Y.: Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders. In: Santis, A.D. (ed.) EUROCRYPT\u201994. LNCS, vol.\u00a0950, pp. 194\u2013204. Springer, Heidelberg (May 1995). https:\/\/doi.org\/10.1007\/BFb0053435","DOI":"10.1007\/BFb0053435"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT\u00a02006. LNCS, vol.\u00a04004, pp. 465\u2013485. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2006). https:\/\/doi.org\/10.1007\/11761679_28","DOI":"10.1007\/11761679_28"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple schnorr multi-signatures with applications to bitcoin. Designs, Codes and Cryptography 87, 2139 \u2013 2164 (2019), https:\/\/api.semanticscholar.org\/CorpusID:4053539","DOI":"10.1007\/s10623-019-00608-x"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: Extended abstract. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001. pp. 245\u2013254. ACM Press (Nov 2001). https:\/\/doi.org\/10.1145\/501983.502017","DOI":"10.1145\/501983.502017"},{"key":"13_CR42","doi-asserted-by":"crossref","unstructured":"Michels, M., Horster, P.: On the risk of disruption in several multiparty signature schemes. In: Kim, K., Matsumoto, T. (eds.) Advances in Cryptology \u2014 ASIACRYPT \u201996. pp. 334\u2013345. Springer Berlin Heidelberg, Berlin, Heidelberg (1996)","DOI":"10.1007\/BFb0034859"},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: Simple two-round Schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 189\u2013221. Springer, Heidelberg, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8","DOI":"10.1007\/978-3-030-84242-0_8"},{"key":"13_CR44","doi-asserted-by":"publisher","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020. pp. 1717\u20131731. ACM Press (Nov 2020). https:\/\/doi.org\/10.1145\/3372297.3417236","DOI":"10.1145\/3372297.3417236"},{"key":"13_CR45","doi-asserted-by":"publisher","unstructured":"Ohta, K., Okamoto, T.: A digital multisignature scheme based on the Fiat-Shamir scheme. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds.) ASIACRYPT\u201991. LNCS, vol.\u00a0739, pp. 139\u2013148. Springer, Heidelberg (Nov 1993). https:\/\/doi.org\/10.1007\/3-540-57332-1_11","DOI":"10.1007\/3-540-57332-1_11"},{"key":"13_CR46","unstructured":"Organization, D.: Drand - a distributed randomness beacon daemon. GitHub repository (2020), https:\/\/github.com\/drand\/drand"},{"key":"13_CR47","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Chopsticks: Fork-free two-round multi-signatures from non-interactive assumptions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 597\u2013627. Springer, Heidelberg (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_21","DOI":"10.1007\/978-3-031-30589-4_21"},{"key":"13_CR48","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Toothpicks: More efficient fork-free two-round multi-signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 460\u2013489. Springer, Heidelberg, Zurich, Switherland (May\u00a026\u201330, 2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_16","DOI":"10.1007\/978-3-031-58716-0_16"},{"key":"13_CR49","doi-asserted-by":"publisher","unstructured":"Qian, H., Li, X., Huang, X.: Tightly secure non-interactive multisignatures in the plain public key model. Informatica (Vilnius) 3 (01 2012). https:\/\/doi.org\/10.15388\/Informatica.2012.369","DOI":"10.15388\/Informatica.2012.369"},{"key":"13_CR50","doi-asserted-by":"publisher","unstructured":"Qian, H., Xu, S.: Non-interactive multisignatures in the plain public-key model with efficient verification. Information Processing Letters 111(2), 82\u201389 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.10.015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019010003212","DOI":"10.1016\/j.ipl.2010.10.015"},{"key":"13_CR51","doi-asserted-by":"publisher","unstructured":"Ristenpart, T., Yilek, S.: The power of proofs-of-possession: Securing multiparty signatures against rogue-key attacks. In: Naor, M. (ed.) EUROCRYPT\u00a02007. LNCS, vol.\u00a04515, pp. 228\u2013245. Springer, Heidelberg (May 2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_13","DOI":"10.1007\/978-3-540-72540-4_13"},{"key":"13_CR52","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 628\u2013658. Springer, Heidelberg (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_22","DOI":"10.1007\/978-3-031-30589-4_22"},{"key":"13_CR53","doi-asserted-by":"publisher","unstructured":"Waters, B.R.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT\u00a02005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (May 2005). https:\/\/doi.org\/10.1007\/11426639_7","DOI":"10.1007\/11426639_7"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0888-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:36:39Z","timestamp":1733823399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}