{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:03:54Z","timestamp":1757624634004,"version":"3.44.0"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019004"},{"type":"electronic","value":"9783032019011"}],"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-01901-1_20","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:45:00Z","timestamp":1755333900000},"page":"628-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Succinct PPRFs via\u00a0Memory-Tight Reductions"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Brzuska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Govinden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Harasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Alpirez Bock, E., Amadori, A., Bos, J.W., Brzuska, C., Michiels, W.: Doubly half-injective PRGs for incompressible white-box cryptography. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 189\u2013209. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_10","DOI":"10.1007\/978-3-030-12612-4_10"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Alwen, J., et al.: Grafting key trees: efficient key management for overlapping groups. In: Nissim, K., Waters, B. (eds.) TCC 2021. Part III, volume 13044 of LNCS, pp. 222\u2013253. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_8","DOI":"10.1007\/978-3-030-90456-2_8"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Anastos, M., et al.: The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024. Part I, volume 15364 of LNCS, pp. 413\u2013443. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78011-0_14","DOI":"10.1007\/978-3-031-78011-0_14"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Alwen, J., et al.: CoCoA: Concurrent continuous group key agreement. In: Dunkelman, O., Dziembowski, S., eds, EUROCRYPT\u00a02022, Part\u00a0II, volume 13276 of LNCS, pp. 815\u2013844. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_28","DOI":"10.1007\/978-3-031-07085-3_28"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Alwen, J., Auerbach, B., Noval, M.C., Klein, K., Pascual-Perez, G., Pietrzak, K.: DeCAF: decentralizable CGKA with fast healing. In: Galdi, C., Phan, D.H., eds, SCN 24, Part\u00a0II, volume 14974 of LNCS, pp. 294\u2013313. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71073-5_14","DOI":"10.1007\/978-3-031-71073-5_14"},{"key":"20_CR6","unstructured":"Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. Cryptology ePrint Archive, Report 2013\/689 (2013)"},{"key":"20_CR7","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-56784-2_9","volume-title":"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, volume 12170 of LNCS, pp. 248\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9"},{"key":"20_CR8","series-title":"Part I, volume 10401 of LNCS","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-63688-7_4","volume-title":"CRYPTO 2017","author":"B Auerbach","year":"2017","unstructured":"Auerbach, B., Cash, D., Fersch, M., Kiltz, E.: Memory-tight reductions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. Part I, volume 10401 of LNCS, pp. 101\u2013132. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_4"},{"key":"20_CR9","series-title":"Part II, volume 12551 of LNCS","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-64378-2_10","volume-title":"TCC 2020","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, volume 12551 of LNCS, pp. 261\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10"},{"key":"20_CR10","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":"20_CR11","series-title":"Part II, volume 13508 of LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-15979-4_2","volume-title":"CRYPTO 2022","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, volume 13508 of LNCS, pp. 34\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_2"},{"key":"20_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-031-30872-7_13","volume-title":"CT-RSA 2023","author":"N Alamati","year":"2023","unstructured":"Alamati, N., Montgomery, H., Patranabis, S.: Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs. In: Rosulek, M. (ed.) CT-RSA 2023. LNCS, vol. 13871, pp. 333\u2013359. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_13"},{"key":"20_CR13","series-title":"Part IV, volume 14084 of LNCS","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-031-38551-3_13","volume-title":"CRYPTO 2023","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, volume 14084 of LNCS, pp. 396\u2013429. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_13"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Auerbach, B., Noval, M.C., Pascual-Perez, G., Pietrzak, K.: On the cost of post-compromise security in concurrent continuous group-key agreement. In: Rothblum, G.N., Wee, H., eds, TCC\u00a02023, Part\u00a0III, volume 14371 of LNCS, pp. 271\u2013300. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_10","DOI":"10.1007\/978-3-031-48621-0_10"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Barnes, R., Beurdouche, B., Robert, R., Millican, J., Omara, E., Cohn-Gordon, K.: The messaging layer security (MLS) protocol. RFC 9420 (2023)","DOI":"10.17487\/RFC9420"},{"key":"20_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"TCC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 52\u201373. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_3"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"20_CR18","series-title":"Part II, volume 13748 of LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-031-22365-5_8","volume-title":"TCC 2022","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, volume 13748 of LNCS, pp. 213\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_8"},{"key":"20_CR19","series-title":"Part II, volume 12551 of LNCS","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-64378-2_8","volume-title":"TCC 2020","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. Part II, volume 12551 of LNCS, pp. 198\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_8"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1515\/jmc-2015-0047","volume":"14","author":"D Boneh","year":"2020","unstructured":"Boneh, D., et al.: Multiparty non-interactive key exchange and more from isogenies on elliptic curves. J. Math. Cryptol. 14(1), 5\u201314 (2020)","journal-title":"J. Math. Cryptol."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Servedio, R.A., Rubinfeld, R., eds, 47th ACM STOC, pp. 439\u2013448. ACM Press (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Bellare, M., Tung Hoang, V.: Efficient schemes for committing authenticated encryption. In: Dunkelman, O., Dziembowski, S., eds, EUROCRYPT\u00a02022, Part\u00a0II, volume 13276 of LNCS, pp. 845\u2013875. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_29","DOI":"10.1007\/978-3-031-07085-3_29"},{"key":"20_CR23","series-title":"Part I, volume 12110 of LNCS","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-45374-9_9","volume-title":"PKC 2020","author":"R Bhattacharyya","year":"2020","unstructured":"Bhattacharyya, R.: Memory-tight reductions for practical key encapsulation mechanisms. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. Part I, volume 12110 of LNCS, pp. 249\u2013278. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_9"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S., ed, EUROCRYPT\u00a02006, volume 4004 of LNCS, pp. 409\u2013426. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25","DOI":"10.1007\/11761679_25"},{"key":"20_CR25","series-title":"Part IV, volume 15487 of LNCS","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-981-96-0894-2_14","volume-title":"ASIACRYPT 2024","author":"C Brzuska","year":"2024","unstructured":"Brzuska, C., \u00dcnal, A., Woo, I.K.Y.: Evasive LWE assumptions: definitions, classes, and counterexamples. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024. Part IV, volume 15487 of LNCS, pp. 418\u2013449. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_14"},{"key":"20_CR26","series-title":"Part I, volume 8616 of LNCS","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s00453-016-0242-8","volume-title":"CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. Part I, volume 8616 of LNCS, pp. 480\u2013499. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/s00453-016-0242-8"},{"key":"20_CR27","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":"20_CR28","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for RAM programs. In: Servedio, R.A., Rubinfeld, R., eds, 47th ACM STOC, pp. 429\u2013437. ACM Press (2015)","DOI":"10.1145\/2746539.2746621"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Lebrun, G., Martinelli, A., Taleb, A.R.: Quarantined-TreeKEM: a continuous group key agreement for MLS, secure in presence of inactive users. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D., eds, ACM CCS 2024, pp. 2400\u20132414. ACM Press (2024)","DOI":"10.1145\/3658644.3690265"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: 7th ACM STOC, pp. 83\u201397. ACM Press (1975)","DOI":"10.1145\/800116.803756"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Devigne, J., Duguey, C., Fouque, P.-A.: MLS group messaging: how zero-knowledge can secure updates. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. Part II, volume 12973 of LNCS, pp. 587\u2013607. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_29","DOI":"10.1007\/978-3-030-88428-4_29"},{"key":"20_CR32","series-title":"Part IV, volume 13093 of LNCS","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-030-92068-5_14","volume-title":"ASIACRYPT 2021","author":"D Diemert","year":"2021","unstructured":"Diemert, D., Gellert, K., Jager, T., Lyu, L.: Digital signatures with memory-tight security in the multi-challenge setting. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. Part IV, volume 13093 of LNCS, pp. 403\u2013433. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_14"},{"key":"20_CR33","series-title":"Part II, volume 12106 of LNCS","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-030-45724-2_15","volume-title":"EUROCRYPT 2020","author":"I Dinur","year":"2020","unstructured":"Dinur, I.: On the streaming indistinguishability of a random permutation and a random function. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. Part II, volume 12106 of LNCS, pp. 433\u2013460. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_15"},{"key":"20_CR34","series-title":"Part III, volume 12552 of LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-64381-2_12","volume-title":"TCC 2020","author":"W Dai","year":"2020","unstructured":"Dai, W., Tessaro, S., Zhang, X.: Super-linear time-memory trade-offs for symmetric encryption. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. Part III, volume 12552 of LNCS, pp. 335\u2013365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_12"},{"issue":"1","key":"20_CR35","doi-asserted-by":"publisher","first-page":"449","DOI":"10.46586\/tosc.v2017.i1.449-473","volume":"2017","author":"P Farshim","year":"2017","unstructured":"Farshim, P., Orlandi, C., Ro\u015fie, R.: Security of symmetric primitives under incorrect usage of keys. IACR Trans. Symm. Cryptol. 2017(1), 449\u2013473 (2017)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Ghoshal, A., Ghosal, R., Jaeger, J., Tessaro, S.: Hiding in plain sight: memory-tight proofs via randomness programming. In: Dunkelman, O., Dziembowski, S., eds, EUROCRYPT\u00a02022, Part\u00a0II, volume 13276 of LNCS, pp. 706\u2013735. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-07085-3_24"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press (1984)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"20_CR38","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-56784-2_5","volume-title":"CRYPTO 2020","author":"A Ghoshal","year":"2020","unstructured":"Ghoshal, A., Jaeger, J., Tessaro, S.: The memory-tightness of authenticated encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part I, volume 12170 of LNCS, pp. 127\u2013156. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_5"},{"key":"20_CR39","series-title":"Part I, volume 12550 of LNCS","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-64375-1_9","volume-title":"TCC 2020","author":"R Goyal","year":"2020","unstructured":"Goyal, R., Koppula, V., Vusirikala, S., Waters, B.: On perfect correctness in (lockable) obfuscation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. Part I, volume 12550 of LNCS, pp. 229\u2013259. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_9"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press (1989)","DOI":"10.1145\/73007.73010"},{"key":"20_CR41","series-title":"Part II, volume 9815 of LNCS","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-53008-5_20","volume-title":"CRYPTO 2016","author":"S Garg","year":"2016","unstructured":"Garg, S., Pandey, O., Srinivasan, A.: Revisiting the cryptographic hardness of finding a Nash equilibrium. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. Part II, volume 9815 of LNCS, pp. 579\u2013604. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_20"},{"key":"20_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-56617-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Garg","year":"2017","unstructured":"Garg, S., Pandey, O., Srinivasan, A., Zhandry, M.: Breaking the Sub-Exponential Barrier in Obfustopia. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 156\u2013181. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_6"},{"key":"20_CR43","series-title":"Part II, volume 12106 of LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-45724-2_2","volume-title":"EUROCRYPT 2020","author":"A Ghoshal","year":"2020","unstructured":"Ghoshal, A., Tessaro, S.: On the memory-tightness of hashed ElGamal. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. Part II, volume 12106 of LNCS, pp. 33\u201362. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_2"},{"key":"20_CR44","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":"20_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-662-46497-7_26","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2015","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 668\u2013697. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_26"},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z.: Indistinguishability obfuscation via mathematical proofs of equivalence. In: 63rd FOCS, pp. 1023\u20131034. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS54457.2022.00100"},{"key":"20_CR47","series-title":"Part III, volume 13793 of LNCS","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-031-22969-5_16","volume-title":"ASIACRYPT 2022","author":"J Jaeger","year":"2022","unstructured":"Jaeger, J., Kumar, A.: Memory-tight multi-challenge security of public-key encryption. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. Part III, volume 13793 of LNCS, pp. 454\u2013484. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_16"},{"key":"20_CR48","series-title":"Part I, volume 11476 of LNCS","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-17653-2_16","volume-title":"EUROCRYPT 2019","author":"J Jaeger","year":"2019","unstructured":"Jaeger, J., Tessaro, S.: Tight time-memory trade-offs for symmetric encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part I, volume 11476 of LNCS, pp. 467\u2013497. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_16"},{"key":"20_CR49","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for Turing machines with unbounded memory. In: Servedio, R.A., Rubinfeld, R., eds, 47th ACM STOC, pp. 419\u2013428. ACM Press (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"20_CR50","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":"20_CR51","series-title":"Part II, volume 13748 of LNCS","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-031-22365-5_9","volume-title":"TCC 2022","author":"V Koppula","year":"2022","unstructured":"Koppula, V., Waters, B., Zhandry, M.: Adaptive multiparty NIKE. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. Part II, volume 13748 of LNCS, pp. 244\u2013273. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_9"},{"key":"20_CR52","series-title":"Part I, volume 9562 of LNCS","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-662-49096-9_5","volume-title":"TCC 2016-A","author":"H Lin","year":"2016","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Output-compressing randomized encodings and applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016-A. Part I, volume 9562 of LNCS, pp. 96\u2013124. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_5"},{"key":"20_CR53","series-title":"Part III, volume 15603 of LNCS","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-031-91131-6_6","volume-title":"EUROCRYPT 2025","author":"Y Ma","year":"2025","unstructured":"Ma, Y., Dai, C., Shi, E.: Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025. Part III, volume 15603 of LNCS, pp. 157\u2013186. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_6"},{"key":"20_CR54","series-title":"Part X, volume 14929 of LNCS","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-031-68403-6_2","volume-title":"CRYPTO 2024","author":"S Mathialagan","year":"2024","unstructured":"Mathialagan, S., Peters, S., Vaikuntanathan, V.: Adaptively sound zero-knowledge SNARKs for UP. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. Part X, volume 14929 of LNCS, pp. 38\u201371. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_2"},{"key":"20_CR55","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B., ed, 46th ACM STOC, pp. 475\u2013484. ACM Press (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"20_CR56","series-title":"Part I, volume 11239 of LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03807-6_1","volume-title":"TCC 2018","author":"S Tessaro","year":"2018","unstructured":"Tessaro, S., Thiruvengadam, A.: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. Part I, volume 11239 of LNCS, pp. 3\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_1"},{"key":"20_CR57","unstructured":"Weidner, M.A.: Group messaging for secure asynchronous collaboration. Master\u2019s thesis, University of Cambridge (2019)"},{"key":"20_CR58","doi-asserted-by":"crossref","unstructured":"Wichs, D.: Barriers in cryptography with weak, correlated and leaky sources. In: Kleinberg, R.D. ed, ITCS 2013, pp. 111\u2013126. ACM (2013)","DOI":"10.1145\/2422436.2422451"},{"key":"20_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-78381-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Matsuda, T., Hanaoka, G., Tanaka, K.: Memory lower bounds of reductions revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 61\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_3"},{"key":"20_CR60","series-title":"Part VII, volume 14657 of LNCS","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-031-58754-2_2","volume-title":"EUROCRYPT 2024","author":"K Xagawa","year":"2024","unstructured":"Xagawa, K.: Signatures with memory-tight security in the quantum random oracle model. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. Part VII, volume 14657 of LNCS, pp. 30\u201358. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_2"},{"key":"20_CR61","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd FOCS, pp. 80\u201391. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.45"}],"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-01901-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:57:44Z","timestamp":1757429864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01901-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019004","9783032019011"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01901-1_20","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"}}]}}