{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:22:30Z","timestamp":1775794950906,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385520","type":"print"},{"value":"9783642385537","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38553-7_6","type":"book-chapter","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:47:12Z","timestamp":1368060432000},"page":"107-126","source":"Crossref","is-referenced-by-count":11,"title":["HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Duc","sequence":"first","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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":"6_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: Schulman (ed.) [56], pp. 171\u2013180","DOI":"10.1145\/1806689.1806715"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-73458-1_15","volume-title":"Information Security and Privacy","author":"J.-P. Aumasson","year":"2007","unstructured":"Aumasson, J.-P., et al.: TCHo: A Hardware-Oriented Trapdoor Cipher. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 184\u2013199. Springer, Heidelberg (2007)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Becker","year":"2012","unstructured":"Becker, A., et al.: Decoding Random Binary Linear Codes in 2 n\/20: How 1 + 1 = 0 Improves Information Set Decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"6_CR5","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation (Full Version) (1997), http:\/\/cseweb.ucsd.edu\/users\/mihir"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption (Extended Abstract). In: FOCS, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Introduction to post-quantum cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 1\u201314. Springer (2009)","DOI":"10.1007\/978-3-540-88702-7_1"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and Defending the McEliece Cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller Decoding Exponents: Ball-Collision Decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"6_CR10","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.L., Kearns, M., Lipton, R.J.: 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":"6_CR11","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\u00a050(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Dottax, E.: HB\u2009+\u2009+\u2009: a Lightweight Authentication Protocol Secure against Some Attacks. In: SecPerU, pp. 28\u201333. IEEE Computer Society (2006)","DOI":"10.1109\/SECPERU.2006.10"},{"key":"6_CR13","unstructured":"Canteaut, A., Chabanne, H.: A Further Improvement of the Work Factor in an Attempt at Breaking McEliece\u2019s Cryptosystem. In: Charpin, P. (ed.) EUROCODE (1994)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece\u2019s Cryptosystem and to Narrow-Sense BCH Codes of Length 511. IEEE Transactions on Information Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-49649-1_16","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Sendrier, N.: Cryptanalysis of the Original McEliece Cryptosystem. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 187\u2013199. Springer, Heidelberg (1998)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","year":"2005","unstructured":"Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.): APPROX\/RANDOM 2005. LNCS, vol.\u00a03624. Springer, Heidelberg (2005)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-Malleable Cryptography (Extended Abstract). In: Koutsougeras, C., Vitter, J.S. (eds.) STOC, pp. 542\u2013552. ACM (1991)","DOI":"10.1145\/103418.103474"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-34961-4_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N. D\u00f6ttling","year":"2012","unstructured":"D\u00f6ttling, N., M\u00fcller-Quade, J., Nascimento, A.C.A.: IND-CCA Secure Cryptography Based on a Variant of the LPN Problem. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 485\u2013503. Springer, Heidelberg (2012)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Duc, A., Vaudenay, S.: HELEN: a Public-key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems (Extended Abstract). In: Yet Another Conference on Cryptography (2012)","DOI":"10.1007\/978-3-642-38553-7_6"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-30904-5_7","volume-title":"Advances in Network Analysis and its Applications, Mathematics in Industry","author":"A. Duc","year":"2013","unstructured":"Duc, A., Vaudenay, S.: TCHo: A Code-Based Cryptosystem. In: Kranakis, E. (ed.) Advances in Network Analysis and its Applications, Mathematics in Industry, vol.\u00a018, pp. 149\u2013179. Springer, Heidelberg (2013)"},{"key":"6_CR21","unstructured":"Duc, D.N., Kim, K.: Securing HB\u2009+\u2009 against GRS man-in-the-middle attack. In: Institute of Electronics, Information and Communication Engineers, Symposium on Cryptography and Information Security (2007)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based Cryptosystems. In: Matsui (ed.) [44], pp. 88\u2013105","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-74462-7_19","volume-title":"Selected Areas in Cryptography","author":"M. Finiasz","year":"2007","unstructured":"Finiasz, M., Vaudenay, S.: When Stream Cipher Analysis Meets Public-Key Cryptography. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 266\u2013284. Springer, Heidelberg (2007)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11941378_5","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"M.P.C. Fossorier","year":"2006","unstructured":"Fossorier, M.P.C., Mihaljevi\u0107, M.J., Imai, H., Cui, Y., Matsuura, K.: An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 48\u201362. Springer, Heidelberg (2006)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) STOC, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"issue":"21","key":"6_CR28","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1049\/el:20052622","volume":"41","author":"H. Gilbert","year":"2005","unstructured":"Gilbert, H., Robshaw, M., Sibert, H.: Active attack against HB\u2009+\u2009: a provably secure lightweight authentication protocol. Electronics Letters\u00a041(21), 1169\u20131170 (2005)","journal-title":"Electronics Letters"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85230-8_12","volume-title":"Financial Cryptography and Data Security","author":"H. Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M., Seurin, Y.: Good Variants of HB\u2009+\u2009 Are Hard to Find. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 156\u2013170. Springer, Heidelberg (2008)"},{"key":"6_CR30","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 Efficiency of HB\u2009+\u2009. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 361\u2013378. Springer, Heidelberg (2008)"},{"key":"6_CR31","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., 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":"6_CR32","unstructured":"Heyse, S., Kiltz, E., Lyubashesvky, V., Paar, C., Pietrzak, K.: An Efficient Authentication Protocol Based on Ring-LPN. In: ECRYPT Workshop on Lightweight Cryptography 2007 (2011), http:\/\/www.uclouvain.be\/crypto\/ecrypt_lc11\/static\/pre_proceedings_2.pdf"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"6_CR34","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)"},{"issue":"2","key":"6_CR35","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D.S. Johnson","year":"1982","unstructured":"Johnson, D.S.: The NP-Completeness Column: An Ongoing Guide. J. Algorithms\u00a03(2), 182\u2013195 (1982)","journal-title":"J. Algorithms"},{"key":"6_CR36","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":"6_CR37","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)"},{"key":"6_CR38","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":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"P.J. Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An Observation on the Security of McEliece\u2019s Public-Key Cryptosystem. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 275\u2013280. Springer, Heidelberg (1988)"},{"key":"6_CR40","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":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R. Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better Key Sizes (and Attacks) for LWE-Based Encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. In: Chekuri, et al. (eds.) [16], pp. 378\u2013389","DOI":"10.1007\/11538462_32"},{"key":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","year":"2009","unstructured":"Matsui, M. (ed.): ASIACRYPT 2009. LNCS, vol.\u00a05912. Springer, Heidelberg (2009)"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A. May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding Random Linear Codes in $\\tilde{\\mathcal{O}}(2^{0.054n})$ . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"issue":"44","key":"6_CR46","first-page":"114","volume":"42","author":"R.J. McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report\u00a042(44), 114\u2013116 (1978)","journal-title":"DSN Progress Report"},{"issue":"9","key":"6_CR47","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"},{"issue":"2","key":"6_CR48","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-89255-7_8","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"K. Ouafi","year":"2008","unstructured":"Ouafi, K., Overbeck, R., Vaudenay, S.: On the Security of HB# against a Man-in-the-Middle Attack. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 108\u2013124. Springer, Heidelberg (2008)"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) STOC, pp. 333\u2013342. ACM (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-Set Decoding for Linear Codes over F q . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"6_CR52","unstructured":"Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization (1979)"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"6_CR54","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"6_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"key":"6_CR56","unstructured":"Schulman, L.J. (ed.): Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, June 5-8. ACM (2010)"},{"key":"6_CR57","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient Public Key Encryption Based on Ideal Lattices. In: Matsui (ed.) [44], pp. 617\u2013635","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"6_CR58","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)"},{"issue":"6","key":"6_CR59","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The Intractability of Computing the Minimum Distance of a Code. IEEE Transactions on Information Theory\u00a043(6), 1757\u20131766 (1997)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38553-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:17:54Z","timestamp":1746004674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38553-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385520","9783642385537"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38553-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}