{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:01Z","timestamp":1777964461766,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45611-8_1","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:34:07Z","timestamp":1415961247000},"page":"1-20","source":"Crossref","is-referenced-by-count":36,"title":["Solving LPN Using Covering Codes"],"prefix":"10.1007","author":[{"given":"Qian","family":"Guo","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Johansson","sequence":"additional","affiliation":[]},{"given":"Carl","family":"L\u00f6ndahl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on Average Case vs Approximation Complexity. In: FOCS, pp. 298\u2013307. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"1_CR2","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 - CRYPTO \u201993","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.: Cryptographic Primitives Based on Hard Learning Problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"issue":"4","key":"1_CR3","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. Journal of the ACM\u00a050(4), 506\u2013519 (2003)","journal-title":"Journal of the ACM"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E.R. Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the Inherent Intractability of Certain Coding Problems. IEEE Trans. Info. Theory\u00a024, 384\u2013386 (1978)","journal-title":"IEEE Trans. Info. Theory"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-36140-1_10","volume-title":"Radio Frequency Identification. Security and Privacy Issues","author":"D.J. Bernstein","year":"2013","unstructured":"Bernstein, D.J., Lange, T.: Never trust a bunny. In: Hoepman, J.-H., Verbauwhede, I. (eds.) RFIDSec 2012. LNCS, vol.\u00a07739, pp. 137\u2013148. Springer, Heidelberg (2013)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-46035-7_14","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"P. Chose","year":"2002","unstructured":"Chose, P., Joux, A., Mitton, M.: Fast Correlation Attacks: An Algorithmic Point of View. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 209\u2013221. Springer, Heidelberg (2002)"},{"key":"1_CR7","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Elsevier (1997)"},{"key":"1_CR8","unstructured":"Damg\u00e5rd, I., Park, S.: Is Public-Key Encryption Based on LPN Practical? Cryptology ePrint Archive, Report 2012\/699 (2012), http:\/\/eprint.iacr.org\/"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-29011-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y. Dodis","year":"2012","unstructured":"Dodis, Y., Kiltz, E., Pietrzak, K., Wichs, D.: Message Authentication, Revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 355\u2013374. Springer, Heidelberg (2012)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-38553-7_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"A. Duc","year":"2013","unstructured":"Duc, A., Vaudenay, S.: HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol.\u00a07918, pp. 107\u2013126. Springer, Heidelberg (2013)"},{"key":"1_CR11","unstructured":"Fossorier, M.P.C., Mihaljevic, M.J., Imai, H., Cui, Y., Matsuura, K.: A Novel Algorithm for Solving the LPN Problem and its Application to Security Evaluation of the HB Protocol for RFID Authentication. Cryptology ePrint archive, Report 2012\/197 (2012), http:\/\/eprint.iacr.org\/"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-78967-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"H. Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M., Seurin, Y.: HB#: Increasing the Security and the Efficiency of HB\u2009+\u2009. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 361\u2013378. Springer, Heidelberg (2008)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-70583-3_55","volume-title":"Automata, Languages and Programming","author":"H. Gilbert","year":"2008","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.\u00a05126, pp. 679\u2013690. Springer, Heidelberg (2008)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert, H., Robshaw, M.J.B., Sibert, H.: An active attack against HB\u2009+\u2009\u2014a provably secure lightweight authentication protocol. Cryptology ePrint Archive, Report 2005\/237 (2005), http:\/\/eprint.iacr.org\/","DOI":"10.1049\/el:20052622"},{"key":"1_CR15","unstructured":"Guo, Q., Johansson, T., L\u00f6ndahl, C.: Solving LPN Using Covering Codes and Soft Information (in preparation)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-34047-5_20","volume-title":"Fast Software Encryption","author":"S. Heyse","year":"2012","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. LNCS, vol.\u00a07549, pp. 346\u2013365. Springer, Heidelberg (2012)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45682-1_4","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.J. Hopper","year":"2001","unstructured":"Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 52\u201366. Springer, Heidelberg (2001)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11535218_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Juels","year":"2005","unstructured":"Juels, A., Weis, S.A.: Authenticating pervasive devices with human protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11761679_6","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Shin, J.S.: Parallel and concurrent security of the HB and HB\u2009+\u2009 protocols. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 73\u201387. Springer, Heidelberg (2006)"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00145-010-9061-2","volume":"23","author":"J. Katz","year":"2010","unstructured":"Katz, J., Shin, J.S., Smith, A.: Parallel and concurrent security of the HB and HB\u2009+\u2009 protocols. Journal of Cryptology\u00a023(3), 402\u2013421 (2010)","journal-title":"Journal of Cryptology"},{"issue":"6","key":"1_CR21","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M. Kearns","year":"1998","unstructured":"Kearns, M.: Effcient Noise-Tolerant Learning from Statistical Queries. J. ACM\u00a045(6), 983\u20131006 (1998)","journal-title":"J. ACM"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-20465-4_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"E. Kiltz","year":"2011","unstructured":"Kiltz, E., Pietrzak, K., Cash, D., Jain, A., Venturi, D.: Efficient Authentication from Hard Learning Problems. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 7\u201326. Springer, Heidelberg (2011)"},{"key":"1_CR23","unstructured":"Kirchner, P.: Improved Generalized Birthday Attack. Cryptology ePrint Archive, Report 2011\/377 (2011), http:\/\/eprint.iacr.org\/"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-011-9484-2","volume":"62","author":"M. Lamberger","year":"2012","unstructured":"Lamberger, M., Mendel, F., Rijmen, V., Simoens, K.: Memoryless near-collisions via coding theory. Designs, Codes and Cryptography\u00a062(1), 1\u201318 (2012)","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2012.11.004","volume":"113","author":"M. Lamberger","year":"2013","unstructured":"Lamberger, M., Teufl, E.: Memoryless near-collisions, revisited. Information Processing Letters\u00a0113(3), 60\u201366 (2013)","journal-title":"Information Processing Letters"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11832072_24","volume-title":"Security and Cryptography for Networks","author":"\u00c9. Levieil","year":"2006","unstructured":"Levieil, \u00c9., Fouque, P.-A.: An Improved LPN Algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 348\u2013359. Springer, Heidelberg (2006)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11538462_32","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Lyubashevsky","year":"2005","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.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 378\u2013389. Springer, Heidelberg (2005)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"issue":"9","key":"1_CR29","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1016\/j.comnet.2007.01.011","volume":"51","author":"J. Munilla","year":"2007","unstructured":"Munilla, J., Peinado, A.: HB-MP: A further step in the HB-family of lightweight authentication protocols. Computer Networks\u00a051(9), 2262\u20132267 (2007)","journal-title":"Computer Networks"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Regev, O.: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J. Stern","year":"1989","unstructured":"Stern, J.: A Method for Finding Codewords of Small Weight. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013304. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45611-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:53:32Z","timestamp":1747158812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45611-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45611-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}