An improved LPN algorithm

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

Volumn 4116 LNCS, Issue , 2006, Pages 348-359

  Levieil, Éric ^a   Fouque, Pierre Alain ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; IDENTIFICATION (CONTROL SYSTEMS); LEARNING SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

COMPUTATIONAL COSTS; LEARNING PARITY WITH NOISE (LPN) PROBLEM; RADIO-FREQUENCY IDENTIFICATION(RFID);

ALGORITHMS;

EID: 33749998666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11832072_24     Document Type: Conference Paper

References (14)

1. E. R. Berlekamp, R. J. McEliece, V. Tilborg. On the Inherent Intractability of Certain Coding Problem. IEEE Transactions on Information Theory 24, 1978, pp. 384-386.
2. A. Blum, M. Furst, M. Kearns, and R. J. Lipton. Cryptographic Primitives Based on Hard Learning Problems. Crypto '93, pp. 278-291, LNCS 773, Springer-Verlag, 1994.
3. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant Learning, the Parity Problem, and the Statistical Query Problem Journal of the ACM 50,4, July 2003, pp. 506-519.
4. J. Bringer, H. Chabanne, and E. Dottax. HB++: A Lightweight Authentication Protocol Secure againt Some Attacks. IEEE International Conference on Pervasive Services, Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, SecPerU, 2006 Available at http://eprint.iacr.org/2005/440.
5. H. Gilbert, M. Robshaw, and H. Sibert. An Active Attack Against HB+ - A Provably Secure Lightweight Authentication Protocol. Available at http://eprint.iacr.org/2005/237.
6. O. Goldreich and L. Levin. A Hard Predicate for all one-way functions, STOC '89, pp. 25-32, ACM 1998.
7. J. Hastad. Some Optimal Inapproximability Results, STOC '97, pp. 1-10, ACM 1997.
8. N. Hopper and M. Blum. Secure Human Identification Protocols ASIACRYPT '01, pp. 52-66, LNCS 2248, Springer-Verlag, 2001.
9. A. Juels and S. Weis. Authenticating Pervasive Devices with Human Protocols Crypto 2005, pp. 293-308, LNCS 3621, Springer-Verlag, 2005. Updated version available at: http://www.rsasecurity.com/rsalabs/staff/ bios/ajuels/publications/pdfs/lpn.pdf.
10. J. Katz and J. Sun Shin. Parallel and Concurrent Security of the HB and HB+ Protocols. Eurocrypt '06, pp., LNCS 4004, Springer-Verlag, 2006.
11. M. Kearns. Efficient Noise-Tolerant Learning from Statistical Queries. J. ACM, 45(6): 983-1006, 1998.
12. M. Mitzenmacher and E. Upfal. Probability and computing, Cambridge University Press, 2005
13. O. Regev. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography STOC 2005, pp. 84-93, ACM 2005.
14. D. Wagner. A Generalized Birthday Problem Crypto 2002, pp. 288-303, LNCS 2442, Springer-Verlag, 2002.