We present a probabilistic private-key encryption scheme named LPN-C whose security can be reduced to the hardness of the Learning from Parity with Noise (LPN) problem. The proposed protocol involves only basic operations in GF(2) and an error-correcting code. We show that it achieves indistinguishability under adaptive chosen plaintext attacks (IND-P2-C0). Appending a secure MAC renders the scheme secure under adaptive chosen ciphertext attacks. This scheme enriches the range of available cryptographic primitives whose security relies on the hardness of the LPN problem. © 2008 Springer-Verlag.
CITATION STYLE
Gilbert, H., Robshaw, M. J. B., & Seurin, Y. (2008). How to encrypt with the LPN problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 679–690). https://doi.org/10.1007/978-3-540-70583-3_55
Mendeley helps you to discover research relevant for your work.