{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:05:52Z","timestamp":1757624752364,"version":"3.44.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019127"},{"type":"electronic","value":"9783032019134"}],"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_3","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:43Z","timestamp":1755332563000},"page":"75-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GURKE: Group Unidirectional Ratcheted Key Exchange"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9379-1678","authenticated-orcid":false,"given":"Daniel","family":"Collins","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2324-5671","authenticated-orcid":false,"given":"Paul","family":"R\u00f6sler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-90456-2_8","volume-title":"Theory of Cryptography","author":"J Alwen","year":"2021","unstructured":"Alwen, J., et al.: Grafting key trees: efficient key management for overlapping groups. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part III. LNCS, vol. 13044, pp. 222\u2013253. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_8"},{"key":"3_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/978-3-031-07085-3_28","volume-title":"EUROCRYPT 2022, Part II","author":"J Alwen","year":"2022","unstructured":"Alwen, J., et al.: CoCoA: concurrent continuous group key agreement. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 815\u2013844. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_28"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-17653-2_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Alwen","year":"2019","unstructured":"Alwen, J., Coretti, S., Dodis, Y.: The double ratchet: security notions, proofs, and modularization for the signal protocol. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 129\u2013158. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_5"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-56784-2_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 248\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Modular design of secure group messaging protocols and the security of MLS. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1463\u20131483. ACM Press (2021)","DOI":"10.1145\/3460120.3484820"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-64378-2_10","volume-title":"Theory of Cryptography","author":"J Alwen","year":"2020","unstructured":"Alwen, J., Coretti, S., Jost, D., Mularczyk, M.: Continuous group key agreement with active security. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 261\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Dowling, B., Jones, D.: Device-oriented group messaging: a formal cryptographic analysis of matrix\u2019 core. In: 2024 IEEE Symposium on Security and Privacy, pp. 2666\u20131685. IEEE Computer Society Press (2024)","DOI":"10.1109\/SP54263.2024.00075"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Alwen, J., Hartmann, D., Kiltz, E., Mularczyk, M.: Server-aided continuous group key agreement. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 69\u201382. ACM Press (2022)","DOI":"10.1145\/3548606.3560632"},{"key":"3_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-15979-4_2","volume-title":"CRYPTO 2022, Part II","author":"J Alwen","year":"2022","unstructured":"Alwen, J., Jost, D., Mularczyk, M.: On the insider security of MLS. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 34\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_2"},{"key":"3_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-031-38551-3_13","volume-title":"CRYPTO 2023, Part IV","author":"J Alwen","year":"2023","unstructured":"Alwen, J., Mularczyk, M., Tselekounis, Y.: Fork-resilient continuous group key agreement. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 396\u2013429. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_13"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Auerbach, B., Noval, M.C., Pascual-Perez, G., Pietrzak, K.: On the cost of post-compromise security in concurrent continuous group-key agreement. Cryptology ePrint Archive, Report 2023\/1123 (2023)","DOI":"10.1007\/978-3-031-48621-0_10"},{"key":"3_CR12","unstructured":"Bhargavan, K., Barnes, R., Rescorla, E.: TreeKEM: asynchronous Decentralized Key Management for Large Dynamic Groups A protocol proposal for Messaging Layer Security (MLS). Research report, Inria Paris (2018)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Barnes, R., Beurdouche, K., Robert, R., Millican, J., Omara, E., Cohn-Gordon, K.: The Messaging Layer Security (MLS) Protocol. RFC 9420 (2023)","DOI":"10.17487\/RFC9420"},{"key":"3_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-031-38551-3_12","volume-title":"CRYPTO 2023, Part IV","author":"K Barooti","year":"2023","unstructured":"Barooti, K., Collins, D., Colombo, S., Huguenin-Dumittan, L., Vaudenay, S.: On active attack detection in messaging with immediate decryption. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 362\u2013395. Springer, Cham (2023)"},{"key":"3_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-981-99-8733-7_10","volume-title":"ASIACRYPT 2023, Part V","author":"D Balb\u00e1s","year":"2023","unstructured":"Balb\u00e1s, D., Collins, D., Gajland, P.: WhatsUpp with sender keys? Analysis, improvements and security proofs. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part V. LNCS, vol. 14442, pp. 307\u2013341. Springer, Singapore (2023)"},{"key":"3_CR16","unstructured":"Balb\u00e1s, D., Collins, D., Vaudenay, S.: Cryptographic administration for secure group messaging. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 1253\u20131270. USENIX Association (2023)"},{"key":"3_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-031-22365-5_8","volume-title":"TCC 2022, Part II","author":"A Bienstock","year":"2022","unstructured":"Bienstock, A., Dodis, Y., Garg, S., Grogan, G., Hajiabadi, M., R\u00f6sler, P.: On the worst-case inefficiency of CGKA. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 213\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_8"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-64378-2_8","volume-title":"Theory of Cryptography","author":"A Bienstock","year":"2020","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P.: On the price of concurrency in group ratcheting protocols. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 198\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_8"},{"key":"3_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-981-96-0888-1_12","volume-title":"ASIACRYPT 2024, Part II","author":"A Bienstock","year":"2024","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P., Wichs, D.: Interval key-encapsulation mechanism. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part II. LNCS, vol. 15485, pp. 361\u2013393. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0888-1_12"},{"key":"3_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-95312-6_1","volume-title":"CT-RSA 2022","author":"A Bienstock","year":"2022","unstructured":"Bienstock, A., Dodis, Y., Tang, Y.: Multicast key agreement, revisited. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 1\u201325. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_1"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Fischlin, M., Warinschi, B., Williams, S.C.: Composability of Bellare-Rogaway key exchange protocols. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011, pp. 51\u201362. ACM Press (2011)","DOI":"10.1145\/2046707.2046716"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-030-64840-4_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"F Balli","year":"2020","unstructured":"Balli, F., R\u00f6sler, P., Vaudenay, S.: Determining the core primitive for optimally secure ratcheting. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 621\u2013650. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_21"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-63697-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Bellare","year":"2017","unstructured":"Bellare, M., Singh, A.C., Jaeger, J., Nyayapati, M., Stepanovs, I.: Ratcheted encryption and key exchange: the security of messaging. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 619\u2013650. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_21"},{"issue":"4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.1007\/s00145-020-09360-1","volume":"33","author":"K Cohn-Gordon","year":"2020","unstructured":"Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L., Stebila, D.: A formal security analysis of the Signal messaging protocol. J. Cryptol. 33(4), 1914\u20131983 (2020)","journal-title":"J. Cryptol."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Cohn-Gordon, K., Cremers, C., Garratt, L., Millican, J., Milner, K.: On ends-to-ends encryption: asynchronous group messaging with strong security guarantees. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1802\u20131819. ACM Press (2018)","DOI":"10.1145\/3243734.3243747"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-030-75248-4_23","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"A Caforio","year":"2021","unstructured":"Caforio, A., Durak, F.B., Vaudenay, S.: Beyond security and efficiency: on-demand ratcheting with security awareness. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 649\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_23"},{"key":"3_CR27","unstructured":"Cremers, C., Hale, B., Kohbrok, K.: The complexities of healing in secure group messaging: why cross-group effects matter. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 1847\u20131864. USENIX Association (2021)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Collins, D., R\u00f6sler, P.: GURKE: group unidirectional ratcheted key exchange. Cryptology ePrint Archive (2025). https:\/\/eprint.iacr.org\/2025\/","DOI":"10.1007\/978-3-032-01913-4_3"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Collins, D., R\u00f6sler, P.: GURKE: group unidirectional ratcheted key exchange. In: Tauman Kalai, Y., Kamara, S.F. (eds.): CRYPTO 2025. LNCS, vol. 16007, pp. xx\u2013yy. Springer, Cham (2025)","DOI":"10.1007\/978-3-032-01913-4_3"},{"key":"3_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-22969-5_5","volume-title":"ASIACRYPT 2022, Part III","author":"B Dowling","year":"2022","unstructured":"Dowling, B., Hauck, E., Riepel, D., R\u00f6sler, P.: Strongly anonymous ratcheted key exchange. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 119\u2013150. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_5"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-26834-3_20","volume-title":"Advances in Information and Computer Security","author":"FB Durak","year":"2019","unstructured":"Durak, F.B., Vaudenay, S.: Bidirectional asynchronous ratcheted key agreement with linear complexity. In: Attrapadung, N., Yagi, T. (eds.) IWSEC 2019. LNCS, vol. 11689, pp. 343\u2013362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26834-3_20"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36362-7_17","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"E Freire","year":"2013","unstructured":"Freire, E., Hofheinz, D., Kiltz, E., Paterson, K.G.: Non-interactive key exchange. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 254\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_17"},{"key":"3_CR33","unstructured":"Maxim Gr\u00fcninger. Proof of concept code and performance evaluation for group unidirectional ratcheted key exchange. GitHub (2025). https:\/\/github.com\/Maximtap\/Gurke"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Hashimoto, K., Katsumata, S., Postlethwaite, E., Prest, T., Westerbaan, B.: A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1441\u20131462. ACM Press (2021)","DOI":"10.1145\/3460120.3484817"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Hashimoto, K., Katsumata, S., Prest, T.: How to hide MetaData in MLS-like secure group messaging: Simple, modular, and post-quantum. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1399\u20131412. ACM Press (2022)","DOI":"10.1145\/3548606.3560679"},{"key":"3_CR36","series-title":"LNCS","first-page":"159","volume-title":"EUROCRYPT 2019, Part I","author":"D Jost","year":"2019","unstructured":"Jost, D., Maurer, U., Mularczyk, M.: Efficient ratcheting: almost-optimal guarantees for secure messaging. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 159\u2013188. Springer, Cham (2019)"},{"key":"3_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96884-1_2","volume-title":"CRYPTO 2018, Part I","author":"J Jaeger","year":"2018","unstructured":"Jaeger, J., Stepanovs, I.: Optimal channel security against fine-grained state compromise: the safety of messaging. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 33\u201362. Springer, Cham (2018)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Klein, K., et al.: Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy, pp. 268\u2013284. IEEE Computer Society Press (2021)","DOI":"10.1109\/SP40001.2021.00035"},{"key":"3_CR39","unstructured":"Len, J., Ghosh, E., Grubbs, P., R\u00f6sler, P.: Interoperability in end-to-end encrypted messaging. Cryptology ePrint Archive, Report 2023\/386 (2023)"},{"key":"3_CR40","unstructured":"Marlinspike, M.: Private group messaging. https:\/\/signal.org\/blog\/private-groups\/ (2014)"},{"key":"3_CR41","unstructured":"Trevor Perrin and Moxie Marlinspike. The double ratchet algorithm (016). https:\/\/signal.org\/docs\/specifications\/doubleratchet\/doubleratchet.pdf 2"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-96884-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"B Poettering","year":"2018","unstructured":"Poettering, B., R\u00f6sler, P.: Towards bidirectional ratcheted key exchange. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 3\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_1"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-75539-3_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"B Poettering","year":"2021","unstructured":"Poettering, B., R\u00f6sler, P., Schwenk, J., Stebila, D.: SoK: game-based security models for group key exchange. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 148\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_7"},{"key":"3_CR44","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-30589-4_1","volume-title":"EUROCRYPT 2023, Part V","author":"P R\u00f6sler","year":"2023","unstructured":"R\u00f6sler, P., Slamanig, D., Striecks, C.: Unique-path identity based encryption with applications to strongly secure messaging. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 3\u201334. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_1"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Weidner, M., Kleppmann, M., Hugenroth, D., Beresford, A.R.: Key agreement for decentralized secure group messaging with strong security guarantees. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2024\u20132045. ACM Press (2021)","DOI":"10.1145\/3460120.3484542"},{"key":"3_CR46","unstructured":"Wallez, T., Protzenko, J., Beurdouche, B., Bhargavan, K.: TreeSync: authenticated group management for messaging layer security. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 1217\u20131233. USENIX Association (2023)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:56:09Z","timestamp":1757429769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}