How to Encrypt with the LPN Problem
In: Automata, Languages and Programming ISBN: 9783540705826 ICALP (2); (2008-08-12)
Online
unknown
Zugriff:
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.
Titel: |
How to Encrypt with the LPN Problem
|
---|---|
Autor/in / Beteiligte Person: | Seurin, Yannick ; Gilbert, Henri ; Robshaw, Matthew |
Link: | |
Quelle: | Automata, Languages and Programming ISBN: 9783540705826 ICALP (2); (2008-08-12) |
Veröffentlichung: | Springer Berlin Heidelberg, 2008 |
Medientyp: | unknown |
ISBN: | 978-3-540-70582-6 (print) |
DOI: | 10.1007/978-3-540-70583-3_55 |
Schlagwort: |
|
Sonstiges: |
|