How to encrypt with the LPN problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 679-690

  Gilbert, Henri ^a   Robshaw, Matthew J B ^a   Seurin, Yannick ^a  

^a ORANGE LABS   (France)

Author keywords

Error correcting code; LPN; Symmetric encryption

Indexed keywords

CRYPTOGRAPHY; HARDNESS; INFORMATION THEORY; LINGUISTICS; TRANSLATION (LANGUAGES);

CHOSEN-CIPHERTEXT ATTACKS; CRYPTOGRAPHIC PRIMITIVES; ERROR-CORRECTING CODE; ERROR-CORRECTING CODING; INDISTINGUISHABILITY; LPN; PLAINTEXT ATTACKS; PRIVATE-KEY ENCRYPTION; SYMMETRIC ENCRYPTION;

BASIC (PROGRAMMING LANGUAGE);

EID: 49149109143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_55     Document Type: Conference Paper

References (28)

1. Aumasson, J.-P., Finiasz, M., Meier, W., Vaudenay, S.: TCHo: A Hardware-Oriented Trapdoor Cipher. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 184-199. Springer, Heidelberg (2007)
2. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. In: Proceedings of FOCS 1997, pp. 394-403 (1997)
3. Bellare, M., Namprempre, C.: Authenticated Encryption: Relations Among Notions and Analysis of the Generic Composition Paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531-545. Springer, Heidelberg (2000)
4. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the Inherent Intractability of Certain Coding Problems. IEEE Trans. Info. Theory 24, 384-386 (1978)
5. Blum, A., Furst, M., Kearns, M., Lipton, R.: Cryptographic Primitives Based on Hard Learning Problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278-291. Springer, Heidelberg (1994)
6. Blum, A., Kalai, A., Wasserman, H.: Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model. J. ACM 50(4), 506-519 (2003); Preliminary version. In: Proceedings of STOC 2000
7. ++: A Lightweight Authentication Protocol Secure Against Some Attacks. In: Proceedings of SecPerU 2006, pp. 28-33. IEEE Computer Society Press, Los Alamitos (2006)
8. Dolev, D., Dwork, C., Naor, M.: Nonmalleable Cryptography. SIAM Journal of Computing 30(2), 391-437 (2000)
9. + Against GRS Man-in-the-Middle Attack. In: Institute of Electronics, Information and Communication Engineers, Symposium on Cryptography and Information Security, January, pp. 23-26 (2007)
10. 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., http://eprint.iacr.org/ 2006/197.pdf
11. + are Hard to Find. In: Proceedings of Financial Crypto 2008 (to appear, 2008)
12. +. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 361-378. Springer, Heidelberg (2008)
13. +: A Provably Secure Lightweight Authentication Protocol. IEE Electronics Letters 41(21), 1169-1170 (2005)
14. Goldreich, O., Krawczyk, H., Luby, M.: On the Existence of Pseudorandom Generators. In: Proceedings of FOCS 1988, pp. 12-21 (1988)
15. Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Science 28(2), 270-299 (1984)
16. Håstad, J.: Some Optimal Inapproximability Results. J. ACM 48(4), 798-859 (2001)
17. Hopper, N., Blum, M.: Secure Human Identification Protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52-66. Springer, Heidelberg (2001)
18. Impagliazzo, R., Levin, L.A.: No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random. In: Proceedings of FOCS 1990, pp. 812-821 (1990)
19. Juels, A., Weis, S.A.: Authenticating Pervasive Devices With Human Protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 293-308. Springer, Heidelberg (2005)
20. + Protocols. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 73-87. Springer, Heidelberg (2006)
21. + Protocols in the "Large Error" Case, http://eprint.iacr.org/2006/326.pdf
22. Katz, J., Yung, M.: Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. Journal of Cryptology 19(1), 67-95 (2006); Preliminary version. In: Proceedings of STOC 2000
23. Levieil, E., Fouque, P.-A.: An Improved LPN Algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 348-359. Springer, Heidelberg (2006)
24. MAGMA Computational Algebra System, http://magma.maths.usyd.edu.au/magma
25. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library (1983)
26. Munilla, J., Peinado, A.: HB-MP: A Further Step in the HB-family of Lightweight Authentication Protocols. Computer Networks 51, 2262-2267 (2007)
27. Rao, T.R.N., Nam, K.H.: Private-Key Algebraic-Code Encryptions. IEEE Transactions on Information Theory 35(4), 829-833 (1989)
28. Regev, O.: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In: Proceedings of STOC 2005, pp. 84-93 (2005)