TY - CONF T1 - Efficient cryptographic protocols based on the hardness of learning parity with noise T2 - Proceedings of the 11th IMA international conference on Cryptography and coding Y1 - 2007 A1 - Katz, Jonathan AB - The problem of learning parity with noise (The LPN problem), which can be re-cast as the problem of decoding a random linear code, has attracted attention recently as a possible tool for developing highly-efficient cryptographic primitives suitable for resource-constrained devices such as RFID tags. This article surveys recent work aimed at designing efficient authentication protocols based on the conjectured hardness of this problem. JA - Proceedings of the 11th IMA international conference on Cryptography and coding T3 - Cryptography and Coding'07 PB - Springer-Verlag CY - Berlin, Heidelberg SN - 3-540-77271-5, 978-3-540-77271-2 UR - http://dl.acm.org/citation.cfm?id=1782574.1782576 ER -