We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the Fujisaki-Okamoto generic construction, HELEN achieves IND-CCA security in the random oracle model. Our cryptosystem looks like the Alekhnovich cryptosystem. However, we carefully study its complexity and we further propose concrete optimized parameters. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Duc, A., & Vaudenay, S. (2013). HELEN: A public-key cryptosystem based on the LPN and the decisional minimal distance problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7918 LNCS, pp. 107–126). Springer Verlag. https://doi.org/10.1007/978-3-642-38553-7_6
Mendeley helps you to discover research relevant for your work.