HELEN: a Public-key Cryptosystem Based on the LPN Problem
Gespeichert in:
| Titel: | HELEN: a Public-key Cryptosystem Based on the LPN Problem |
|---|---|
| Autoren: | Re Duc, Serge Vaudenay |
| Weitere Verfasser: | The Pennsylvania State University CiteSeerX Archives |
| Quelle: | http://infoscience.epfl.ch/record/181613/files/helen.pdf. |
| Bestand: | CiteSeerX |
| Schlagwörter: | Code-based cryptosystem, learning from parity with noise problem, minimum distance problem, random |
| Beschreibung: | 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. |
| Publikationsart: | text |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.5118; http://infoscience.epfl.ch/record/181613/files/helen.pdf |
| Verfügbarkeit: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.5118 http://infoscience.epfl.ch/record/181613/files/helen.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Dokumentencode: | edsbas.180B6A0D |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | 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. |
|---|