zbMATH — the first resource for mathematics

HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems. (English) Zbl 1312.94047
Youssef, Amr (ed.) et al., Progress in cryptology – AFRICACRYPT 2013. 6th international conference on cryptology in Africa, Cairo, Egypt, June 22–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38552-0/pbk). Lecture Notes in Computer Science 7918, 107-126 (2013).
Summary: 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.
For the entire collection see [Zbl 1263.94007].

94A60 Cryptography
Full Text: DOI