{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T03:41:46Z","timestamp":1786246906384,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353764","type":"print"},{"value":"9783032353771","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-35377-1_7","type":"book-chapter","created":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T02:56:50Z","timestamp":1786244210000},"page":"201-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning with\u00a0Alternating Moduli, Arora-Ge over\u00a0Composite Moduli, and\u00a0Weak PRFs"],"prefix":"10.1007","author":[{"given":"Yilei","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liheng","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in $$\\sf AC\\mathit{^0\\circ \\sf MOD}2$$. In: ITCS, pp. 251\u2013260. ACM (2014)","DOI":"10.1145\/2554797.2554821"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alamati, N., Policharla, G., Raghuraman, S., Rindal, P.: Improved alternating-moduli PRFs and post-quantum signatures. In: CRYPTO (8). Lecture Notes in Computer Science, vol. 14927, pp. 274\u2013308. Springer (2024)","DOI":"10.1007\/978-3-031-68397-8_9"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2815111.2815158","volume":"49","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J., Fitzpatrick, R., Perret, L.: Algebraic algorithms for LWE problems. ACM Commun. Comput. Algebra 49(2), 62 (2015)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-662-53641-4_2","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B., Raykov, P.: Fast pseudorandom functions based on expander graphs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 27\u201356. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_2"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2025.i2.1-15","volume":"2025","author":"IM Ayala","year":"2025","unstructured":"Ayala, I.M., Raddum, H.: Zeroed out: cryptanalysis of weak PRFs in alternating moduli. IACR Trans. Symmetric Cryptol. 2025(2), 1\u201315 (2025)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-49096-9_9","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 209\u2013224. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_9"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Rosen, A.: Pseudorandom functions: three decades later. In: Tutorials on the Foundations of Cryptography, pp. 79\u2013158. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-57048-8_3"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-030-03810-6_25","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 699\u2013729. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.46586\/tosc.v2025.i3.289-336","volume":"2025","author":"C Boura","year":"2025","unstructured":"Boura, C., Couteau, G., Perrin, L., Rotella, Y.: SoK: on shallow weak PRFs a common symmetric building block for MPC protocols. IACR Trans. Symmetric Cryptol. 2025(3), 289\u2013336 (2025)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: FOCS, pp. 1069\u20131080. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Low-complexity weak pseudorandom functions in $$\\sf AC\\mathit{^0[\\sf MOD}2]$$. In: CRYPTO (4). Lecture Notes in Computer Science, vol. 12828, pp. 487\u2013516. Springer (2021)","DOI":"10.1007\/978-3-030-84259-8_17"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: STOC, pp. 575\u2013584. ACM (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-75248-4_26","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"JH Cheon","year":"2021","unstructured":"Cheon, J.H., Cho, W., Kim, J.H., Kim, J.: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 739\u2013760. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_26"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Ding, Y., Jain, A., Komargodski, I.: A new approach for LPN-based pseudorandom functions: low-depth and key-homomorphic. In: STOC, pp. 1898\u20131909. ACM (2025)","DOI":"10.1145\/3717823.3718210"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Johansson, T., Meier, W., Nguyen, V.: Differential cryptanalysis of Mod-2\/Mod-3 constructions of binary weak PRFs. In: ISIT, pp. 477\u2013482. IEEE (2023)","DOI":"10.1109\/ISIT54713.2023.10206853"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. In: FOCS, pp. 574\u2013579. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63537"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Matsui, M.: Linear cryptanalysis method for DES cipher. EUROCRYPT. Lecture Notes in Computer Science 765, 386\u2013397 (1993) Springer","DOI":"10.1007\/3-540-48285-7_33"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Noval, M.C., Merz, S., St\u00e4hlin, P., \u00dcnal, A.: On the soundness of algebraic attacks against code-based assumptions. In: EUROCRYPT (6). Lecture Notes in Computer Science, vol. 15606, pp. 385\u2013415. Springer (2025)","DOI":"10.1007\/978-3-031-91095-1_14"},{"issue":"4","key":"7_CR24","first-page":"598","volume":"41","author":"AA Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mat. Zametki 41(4), 598\u2013607 (1987)","journal-title":"Mat. Zametki"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Steiner, M.J.: The complexity of algebraic algorithms for LWE. In: EUROCRYPT (3). Lecture Notes in Computer Science, vol. 14653, pp. 375\u2013403. Springer (2024)","DOI":"10.1007\/978-3-031-58734-4_13"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-55304-3_22","volume-title":"Information Security and Privacy","author":"C Sun","year":"2020","unstructured":"Sun, C., Tibouchi, M., Abe, M.: Revisiting the hardness of binary error LWE. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_22"},{"issue":"3","key":"7_CR29","first-page":"32","volume":"1","author":"R Takhanov","year":"2024","unstructured":"Takhanov, R.: Almost pairwise independence and resilience to deep learning attacks. IACR Commun. Cryptol. 1(3), 32 (2024)","journal-title":"IACR Commun. Cryptol."},{"issue":"4","key":"7_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: a theory for block cipher security. J. Cryptol. 16(4), 249\u2013286 (2003)","journal-title":"J. Cryptol."},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-662-49896-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Yu Yu","year":"2016","unstructured":"Yu, Yu., Steinberger, J.: Pseudorandom functions in almost constant depth from low-noise LPN. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 154\u2013183. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35377-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T02:57:02Z","timestamp":1786244222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35377-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353764","9783032353771"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35377-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}