{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:42:16Z","timestamp":1768902136177,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"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_7","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:22Z","timestamp":1755373282000},"page":"203-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sample Efficient Search to\u00a0Decision for\u00a0kLIN"],"prefix":"10.1007","author":[{"given":"Andrej","family":"Bogdanov","sequence":"first","affiliation":[]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[]},{"given":"Kel Zin","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Bogdanov, A., Rosen, A.: A dichotomy for local small-bias generators. J. Cryptol. 29(3), 577\u2013596 (2016)","DOI":"10.1007\/s00145-015-9202-8"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. J. Cryptol. 22(4), 429\u2013469 (2009)","DOI":"10.1007\/s00145-009-9039-0"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. SIAM J. Comput. 47(1), 52\u201379 (2018)","DOI":"10.1137\/16M1085942"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 298\u2013307 (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Pseudorandom generators with long stretch and low locality from random local one-way functions. SIAM J. Comput. 42(5), 2008\u20132037 (2013)","DOI":"10.1137\/120884857"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24"},{"key":"7_CR7","doi-asserted-by":"crossref","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)","DOI":"10.1145\/792538.792543"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Qiao, Y.: On the security of Goldreich\u2019s one-way function. Comput. Complex. 21(1), 83\u2013127 (2012)","DOI":"10.1007\/s00037-011-0034-0"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Sabin, M., Vasudevan, P.N.: XOR codes and sparse learning parity with noise. In: Proceedings of 2019 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 986\u20131004 (2019)","DOI":"10.1137\/1.9781611975482.61"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Canonne, C.L.: Topics and techniques in distribution testing: a biased but representative sample. Found. Trends Commun. Inf. Theory 19(6), 1032\u20131198 (2022)","DOI":"10.1561\/0100000114"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cook, J., Etesami, O., Miller, R., Trevisan, L.: On the one-way function candidate proposed by goldreich. ACM Trans. Comput. Theory 6(3), 14:1\u201314:35 (2014)","DOI":"10.1145\/2633602"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kalai, Y., Vaikuntanathan, V.: Somewhat homomorphic encryption from linear homomorphism and sparse LPN. IACR Cryptology ePrint Archive, p. 1760 (2024)","DOI":"10.1007\/978-3-031-91124-8_1"},{"key":"7_CR13","unstructured":"Chin, P., Rao, A., Vu, V.: Stochastic block model and community detection in sparse graphs: a spectral algorithm with optimal rate of recovery. In: Proceedings of The 28th Conference on Learning Theory, vol.\u00a040, pp. 391\u2013423 (2015)"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) 43rd Annual International Cryptology Conference, CRYPTO 2023, pp. 315\u2013348 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_11","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Dao, Q., Jain, A.: Lossy cryptography from code-based assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, pp. 34\u201375 (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_2","DOI":"10.1007\/978-3-031-68382-4_2"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Feige, U., Kim, J.H., Ofek, E.: Witnesses for non-satisfiability of dense random 3CNF formulas. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 497\u2013508 (2006)","DOI":"10.1109\/FOCS.2006.78"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2), 251\u2013275 (2005)","DOI":"10.1002\/rsa.20089"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Kothari, P.K., Manohar, P.: Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. In: STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 678\u2013689 (2022)","DOI":"10.1145\/3519935.3519955"},{"key":"7_CR19","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. Electron. Colloquium Comput. Complex., TR00-090 (2000)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On epsilon-biased generators in $$\\rm NC^0$$. Random Struct. Algorithms 29(1), 56\u201381 (2006)","DOI":"10.1002\/rsa.20112"},{"key":"7_CR21","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press (2014)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:38Z","timestamp":1768850498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_7","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"}}]}}