Efficient cryptographic protocols based on the hardness of learning parity with noise
| Title | Efficient cryptographic protocols based on the hardness of learning parity with noise |
| Publication Type | Conference Papers |
| Year of Publication | 2007 |
| Authors | Katz J |
| Conference Name | Proceedings of the 11th IMA international conference on Cryptography and coding |
| Date Published | 2007/// |
| Publisher | Springer-Verlag |
| Conference Location | Berlin, Heidelberg |
| ISBN Number | 3-540-77271-5, 978-3-540-77271-2 |
| Abstract | 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. |
| URL | http://dl.acm.org/citation.cfm?id=1782574.1782576 |