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.


Presented at:
YACC 2012, Porquerolles Island, France, September 24-28 2012
Year:
2012
Keywords:
Laboratories:




 Record created 2012-10-03, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)