{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:32:51Z","timestamp":1768923171537,"version":"3.49.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","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-01855-7_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:29Z","timestamp":1755373289000},"page":"284-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stationary Syndrome Decoding for\u00a0Improved PCGs"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Kolesnikov","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"Peceny","sequence":"additional","affiliation":[]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in ac0 $$\\odot $$ mod2. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS \u201914, pp. 251\u2013260, New York, NY, USA (2014). Association for Computing Machinery","DOI":"10.1145\/2554797.2554821"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Mycrypt (2005)","DOI":"10.1007\/11554868_6"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: 2022 IEEE Symposium on Security and Privacy, pp. 2554\u20132572. IEEE Computer Society Press (2022)","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"10_CR4","series-title":"Part I, volume 13177 of LNCS","first-page":"221","volume-title":"PKC 2022","author":"D Abram","year":"2022","unstructured":"Abram, D., Scholl, P.: Low-communication multiparty triple generation for SPDZ from ring-LPN. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. Part I, volume 13177 of LNCS, pp. 221\u2013251. Springer, Heidelberg (2022)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Schreiber, S.S.: FOLEAGE: $$\\mathbb{F}_{\\scriptstyle 4}$$OLE-based multi-party computation for boolean circuits. In: LNCS, pp. 69\u2013101 (2024)","DOI":"10.1007\/978-981-96-0938-3_3"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J., (eds.) ACM CCS 2019, pp. 291\u2013308. ACM Press (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"10_CR7","series-title":"Part III, volume 11694 of LNCS","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. Part III, volume 11694 of LNCS, pp. 489\u2013518. Springer, Heidelberg (2019)"},{"key":"10_CR8","series-title":"Part II, volume 12171 of LNCS","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part II, volume 12171 of LNCS, pp. 387\u2013416. Springer, Heidelberg (2020)"},{"key":"10_CR9","series-title":"Part II, volume 13508 of LNCS","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-031-15979-4_21","volume-title":"CRYPTO 2022","author":"E Boyle","year":"2022","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part II, volume 13508 of LNCS, pp. 603\u2013633. Springer, Heidelberg (2022)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X., (eds.), ACM CCS 2018, pp. 896\u2013912. ACM Press (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235\u2013265 (1997). Computational algebra and number theory (London (1993)","DOI":"10.1006\/jsco.1996.0125"},{"issue":"8","key":"10_CR12","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1007\/s10623-023-01292-8","volume":"91","author":"C Baum","year":"2023","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: Sok: vector ole-based zero-knowledge protocols. Des. Codes Crypt. 91(8), 3527\u20133561 (2023)","journal-title":"Des. Codes Crypt."},{"key":"10_CR13","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill Series in Systems Science. McGraw-Hill (1968)"},{"key":"10_CR14","series-title":"LNCS","first-page":"278","volume-title":"CRYPTO\u201993","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO\u201993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Tu, Y.: Improved constructions for distributed multi-point functions . In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 2414\u20132432, Los Alamitos, CA, USA (2025). IEEE Computer Society","DOI":"10.1109\/SP61157.2025.00044"},{"key":"10_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: How 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Journal of the ACM (2003)","DOI":"10.1145\/792538.792543"},{"key":"10_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"CRYPTO 2011","author":"J Daniel","year":"2011","unstructured":"Daniel, J.: Bernstein, Tanja Lange, and Christiane Peters. smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-79063-3_2","volume-title":"Post-Quantum Cryptography","author":"L Both","year":"2018","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2"},{"key":"10_CR20","series-title":"Part V, volume 14008 of LNCS","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-031-30589-4_14","volume-title":"EUROCRYPT 2023","author":"P Briaud","year":"2023","unstructured":"Briaud, P., \u00d8ygarden, M.: A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Part V, volume 14008 of LNCS, pp. 391\u2013422. Springer, Heidelberg (2023)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Rosen, A.: Pseudorandom Functions: Three Decades Later, pp. 79\u2013158. Springer International Publishing, Cham (2017)","DOI":"10.1007\/978-3-319-57048-8_3"},{"key":"10_CR22","first-page":"532","volume":"2023","author":"E Carozza","year":"2023","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. In Carmit Hazay and Martijn Stam, editors, Advances in Cryptology - EUROCRYPT 2023, 532\u2013563 (2023)","journal-title":"In Carmit Hazay and Martijn Stam, editors, Advances in Cryptology - EUROCRYPT"},{"key":"10_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"EUROCRYPT 2000","author":"N Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-84252-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 502\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17"},{"key":"10_CR25","series-title":"Part IV, volume 13510 of LNCS","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-031-15985-5_3","volume-title":"CRYPTO 2022","author":"S Dittmer","year":"2022","unstructured":"Dittmer, S., Ishai, Y., Steve, L., Ostrovsky, R.: Authenticated garbling from simple correlations. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part IV, volume 13510 of LNCS, pp. 57\u201387. Springer, Heidelberg (2022)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Doerner, J., shelat, A..: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D., (eds.). ACM CCS 2017, pp. 523\u2013535. ACM Press (2017)","DOI":"10.1145\/3133956.3133967"},{"key":"10_CR27","first-page":"183","volume":"2024","author":"A Esser","year":"2024","unstructured":"Esser, A., Santini, P.: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks. In Leonid Reyzin and Douglas Stebila, editors, Advances in Cryptology - CRYPTO 2024, 183\u2013217 (2024)","journal-title":"In Leonid Reyzin and Douglas Stebila, editors, Advances in Cryptology - CRYPTO"},{"key":"10_CR28","series-title":"Part II, volume 13508 of LNCS","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-031-15979-4_19","volume-title":"CRYPTO 2022","author":"T Feneuil","year":"2022","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part II, volume 13508 of LNCS, pp. 541\u2013572. Springer, Heidelberg (2022)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Fossorier, M.P.C., Kobara, K., Imai, H.: Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of mceliece cryptosystem. IEEE Trans. Info. Theory 53(1), 402\u2013411 (2007)","DOI":"10.1109\/TIT.2006.887515"},{"key":"10_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511801655"},{"key":"10_CR32","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":"10_CR33","series-title":"Part III, volume 10993 of LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-96878-0_1","volume-title":"CRYPTO 2018","author":"C Hazay","year":"2018","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: TinyKeys: a new approach to efficient multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. Part III, volume 10993 of LNCS, pp. 3\u201333. Springer, Heidelberg (2018)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Jabri, A.A.: A statistical decoding algorithm for general linear block codes. In: Honary, B., (ed.), Cryptography and Coding, pp. 1\u20138, Berlin, Heidelberg (2001). Springer Berlin Heidelberg","DOI":"10.1007\/3-540-45325-3_1"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Peceny, S., Raghuraman, S., Rindal, P.: Stationary syndrome decoding for improved PCGs. Cryptology ePrint Archive, Paper 2025\/295 (2025)","DOI":"10.1007\/978-3-032-01855-7_10"},{"key":"10_CR36","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. Cryptology ePrint Archive, Report 2022\/712 (2022). https:\/\/eprint.iacr.org\/2022\/712"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators for any finite field. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 145\u2013175. Springer (2025)","DOI":"10.1007\/978-3-031-91092-0_6"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L., (eds.) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, pp. 378\u2013389 (2005)","DOI":"10.1007\/11538462_32"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\tilde{\\cal{O}}(2^{0.054n})$$. In: Lee, D.H., Wang, X., (eds.), ASIACRYPT\u00a02011, vol. 7073 of LNCS, pp. 107\u2013124. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"10_CR40","series-title":"Part I, volume 9056 of LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. Part I, volume 9056 of LNCS, pp. 203\u2013228. Springer, Heidelberg (2015)"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. In: IRE Transactions on Information Theory (1962)","DOI":"10.1109\/TIT.1962.1057777"},{"key":"10_CR42","series-title":"Part I, volume 13507 of LNCS","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-031-15802-5_23","volume-title":"CRYPTO 2022","author":"L Roy","year":"2022","unstructured":"Roy, L.: SoftSpokenOT: quieter OT extension from small-field silent VOLE in the minicrypt model. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part I, volume 13507 of LNCS, pp. 657\u2013687. Springer, Heidelberg (2022)"},{"key":"10_CR43","unstructured":"Rindal, P., Roy, L.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"10_CR44","series-title":"Part IV, volume 14084 of LNCS","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-031-38551-3_19","volume-title":"CRYPTO 2023","author":"S Raghuraman","year":"2023","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. Part IV, volume 14084 of LNCS, pp. 602\u2013632. Springer, Heidelberg (2023)"},{"key":"10_CR45","series-title":"Part II, volume 12697 of LNCS","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. Part II, volume 12697 of LNCS, pp. 901\u2013930. Springer, Heidelberg (2021)"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: Improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J., (eds.) ACM CCS 2019, pp. 1055\u20131072. ACM Press (2019)","DOI":"10.1145\/3319535.3363228"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Shpilka, A.: Constructions of low-degree and error-correcting $$\\epsilon $$-biased generators. In: computational complexity (2009)","DOI":"10.1007\/s00037-009-0281-5"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J., (eds.) Coding Theory and Applications, pp. 106\u2013113, Berlin, Heidelberg (1989). Springer Berlin Heidelberg","DOI":"10.1007\/BFb0019850"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. In: IEEE Transac- tions on Information Theory (1986)","DOI":"10.1109\/TIT.1986.1057137"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24-27 May 2021, pp. 1074\u20131091. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: AntMan: interactive zero-knowledge proofs with sublinear communication. In: Yin, H., Stavrou, A., Cremers, C., Shi, E.,(eds.) ACM CCS 2022, pp. 2901\u20132914. ACM Press (2022)","DOI":"10.1145\/3548606.3560667"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna, G., Shi, E., (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press (2021)","DOI":"10.1145\/3460120.3484556"}],"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-01855-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:48Z","timestamp":1768850508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_10","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"}}]}}