Infoscience

Conference paper

HELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract)

We propose HELEN, a new 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. We further propose concrete parameters.

Keywords: Code-based cryptosystem ; learning from parity with noise problem ; minimum distance problem ; random linear code ; public-key cryptosystem

Reference

  • EPFL-CONF-181613

Record created on 2012-10-03, modified on 2013-07-02

Related material