{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:20:48Z","timestamp":1742984448251,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904524"},{"type":"electronic","value":"9783030904531"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90453-1_23","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T14:14:32Z","timestamp":1636035272000},"page":"658-688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BKW Meets Fourier New Algorithms for LPN with Sparse Parities"],"prefix":"10.1007","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[]},{"given":"Huijing","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Hunter","family":"Kippen","sequence":"additional","affiliation":[]},{"given":"Aria","family":"Shahverdi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011: 38th International Colloquium on Automata, Languages and Programming, Part I. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Blum, A., Furst, M.L., Jackson, J.C., Kearns, M.J., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In: 26th Annual ACM Symposium on Theory of Computing, pp. 253\u2013262. ACM Press, Montr\u00e9al (1994). https:\/\/doi.org\/10.1145\/195058.195147","DOI":"10.1145\/195058.195147"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) Advances in Cryptology - CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24","DOI":"10.1007\/3-540-48329-2_24"},{"key":"23_CR5","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":"23_CR6","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Sabin, M., Vasudevan, P.N.: XOR codes and sparse learning parity with noise. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 986\u20131004 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.61","DOI":"10.1137\/1.9781611975482.61"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bogos, S., Tramer, F., Vaudenay, S.: On solving LPN using BKW and variants. Crypt. Commun. 8(3), 331\u2013369 (2016)","DOI":"10.1007\/s12095-015-0149-2"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Lombardi, A., Segev, G., Vaikuntanathan, V.: Anonymous IBE, leakage resilience and circular security from new assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018, Part I. LNCS, vol. 10820, pp. 535\u2013564. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_20","DOI":"10.1007\/978-3-319-78381-9_20"},{"key":"23_CR9","unstructured":"Cheon, J.H., Son, Y., Yhee, D.: Practical FHE parameters against lattice attacks. IACR Cryptology ePrint Archive 2021\/39 (2021). https:\/\/eprint.iacr.org\/2021\/039"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Feldman, V., Tan, L.Y., Wan, A., Wimmer, K.: Approximate resilience, monotonicity, and the complexity of agnostic learning. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 498\u2013511. SIAM (2014)","DOI":"10.1137\/1.9781611973730.34"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.K.: New results for learning noisy parities and halfspaces. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 563\u2013574 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.51","DOI":"10.1109\/FOCS.2006.51"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.K.: On agnostic learning of parities, monomials, and halfspaces. SIAM J. Comput. 39(2), 606\u2013645 (2009)","DOI":"10.1137\/070684914"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Robshaw, M.J.B., Seurin, Y.: How to encrypt with the LPN problem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 679\u2013690. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-70583-3_55","DOI":"10.1007\/978-3-540-70583-3_55"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Grigorescu, E., Reyzin, L., Vempala, S.: On noise-tolerant learning of sparse parities and related problems. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 413\u2013424. Springer, Heidelberg (2011) https:\/\/doi.org\/10.1007\/978-3-642-24412-4_32","DOI":"10.1007\/978-3-642-24412-4_32"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., L\u00f6ndahl, C.: Solving LPN using covering codes. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 1\u201320. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_1","DOI":"10.1007\/978-3-662-45611-8_1"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., Pietrzak, K.: Lapin: an efficient authentication protocol based on ring-LPN. In: Canteaut, A. (ed.) FSE 2012, Revised Selected Papers, vol. 7549, pp. 346\u2013365 (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_20","DOI":"10.1007\/978-3-642-34047-5_20"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) Advances in Cryptology - ASIACRYPT 2001. LNCS, vol. 2248, pp. 52\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_4","DOI":"10.1007\/3-540-45682-1_4"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Juels, A., Weis, S.A.: Authenticating pervasive devices with human protocols. In: Shoup, V. (ed.) Advances in Cryptology - CRYPTO 2005. LNCS, vol. 3621, pp. 293\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_18","DOI":"10.1007\/11535218_18"},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Levieil, \u00c9., Fouque, P.A.: An improved LPN algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 348\u2013359. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/11832072_24 (2006)","DOI":"10.1007\/11832072_24"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. ACM 40(3), 607\u2013620 (1993)","DOI":"10.1145\/174130.174138"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A., Vishnoi, N.K.: On the Fourier spectrum of symmetric Boolean functions with applications to learning symmetric juntas. In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), pp. 112\u2013119. IEEE (2005)","DOI":"10.1109\/CCC.2005.19"},{"key":"23_CR22","doi-asserted-by":"publisher","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. APPROX 2005, RANDOM 2005. LNCS, vol. 3624, pp. 378\u2013389. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/11538462_32 (2005)","DOI":"10.1007\/11538462_32"},{"key":"23_CR23","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press (2017)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.P.: Learning juntas. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 206\u2013212 (2003)","DOI":"10.1145\/780542.780574"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and juntas. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/FOCS.2012.27"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Verbeurgt, K.: Learning DNF under the uniform distribution in quasi-polynomial time. In: Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, pp. 314\u2013326. Morgan Kaufmann Publishers Inc., San Francisco (1990)","DOI":"10.1016\/B978-1-55860-146-8.50027-8"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90453-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:22:51Z","timestamp":1730683371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90453-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904524","9783030904531"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90453-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}