{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:14:27Z","timestamp":1768918467861,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683879","type":"print"},{"value":"9783031683886","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68388-6_7","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"158-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Memory-Sample Lower Bounds for\u00a0LWE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3830-0825","authenticated-orcid":false,"given":"Mingqi","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4366-7376","authenticated-orcid":false,"given":"Junzhao","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"7_CR1","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"},{"key":"7_CR2","unstructured":"Beame, P., Gharan, S.O., Yang, X.: Time-space tradeoffs for learning finite functions from random evaluations, with applications to polynomials. In: Conference On Learning Theory, pp. 843\u2013856. PMLR (2018)"},{"key":"7_CR3","unstructured":"Dagan, Y., Kur, G., Shamir, O.: Space lower bounds for linear prediction in the streaming model. In: Conference on Learning Theory, pp. 929\u2013954. PMLR (2019)"},{"key":"7_CR4","unstructured":"Dagan, Y., Shamir, O.: Detecting correlations with little memory and communication. In: Conference On Learning Theory, pp. 1145\u20131198. PMLR (2018)"},{"key":"7_CR5","unstructured":"Garg, S., Kothari, P.K., Liu, P., Raz, R.: Memory-sample lower bounds for learning parity with noise. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"7_CR6","unstructured":"Garg, S., Kothari, P.K., Raz, R.: Time-space tradeoffs for distinguishing distributions and applications to security of goldreich\u2019s prg. arXiv preprint arXiv:2002.07235 (2020)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Garg, S., Raz, R., Tal, A.: Extractor-based time-space lower bounds for learning. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 990\u20131002 (2018)","DOI":"10.1145\/3188745.3188962"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Garg, S., Raz, R., Tal, A.: Time-space lower bounds for two-pass learning. In: 34th Computational Complexity Conference (CCC) (2019)","DOI":"10.1145\/3188745.3188962"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-17659-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Guan","year":"2019","unstructured":"Guan, J., Zhandary, M.: Simple schemes in the bounded storage model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 500\u2013524. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_17"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kol, G., Raz, R., Tal, A.: Time-space hardness of learning sparse parities. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1067\u20131080 (2017)","DOI":"10.1145\/3055399.3055430"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Q., Raz, R., Zhan, W.: Memory-sample lower bounds for learning with classical-quantum hybrid memory. arXiv preprint arXiv:2303.00209 (2023)","DOI":"10.1145\/3564246.3585129"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lyu, X., Tal, A., Wu, H., Yang, J.: Tight time-space lower bounds for constant-pass learning. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1195\u20131202. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00070"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Marsden, A., Sharan, V., Sidford, A., Valiant, G.: Efficient convex optimization requires superlinear memory. In: Conference on Learning Theory, pp. 2390\u20132430. PMLR (2022)","DOI":"10.24963\/ijcai.2023\/722"},{"key":"7_CR14","unstructured":"Moshkovitz, D., Moshkovitz, M.: Mixing implies lower bounds for space bounded learning. In: Conference on Learning Theory, pp. 1516\u20131566. PMLR (2017)"},{"key":"7_CR15","unstructured":"Moshkovitz, D., Moshkovitz, M.: Entropy samplers and strong generic lower bounds for space bounded learning. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"7_CR16","unstructured":"Moshkovitz, M., Tishby, N.: Mixing complexity and its applications to neural networks. arXiv preprint arXiv:1703.00729 (2017)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Raz, R.: Fast learning requires good memory: a time-space lower bound for parity learning (2016)","DOI":"10.1109\/FOCS.2016.36"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186563","volume":"66","author":"R Raz","year":"2018","unstructured":"Raz, R.: Fast learning requires good memory: a time-space lower bound for parity learning. J. ACM (JACM) 66(1), 1\u201318 (2018)","journal-title":"J. ACM (JACM)"},{"key":"7_CR19","unstructured":"Regev, O., Stephens-Davidowitz, N.: A reverse Minkowski theorem (2022)"},{"key":"7_CR20","unstructured":"Shamir, O.: Fundamental limits of online and distributed algorithms for statistical learning and estimation (2014)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Sharan, V., Sidford, A., Valiant, G.: Memory-sample tradeoffs for linear regression with small error. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 890\u2013901 (2019)","DOI":"10.1145\/3313276.3316403"},{"key":"7_CR22","unstructured":"Steinhardt, J., Valiant, G., Wager, S.: Memory, communication, and statistical queries. In: Conference on Learning Theory, pp. 1490\u20131516. PMLR (2016)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68388-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:03:57Z","timestamp":1723795437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68388-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683879","9783031683886"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68388-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}