HELEN: a Public-key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
Saved in:
| Title: | HELEN: a Public-key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems |
|---|---|
| Authors: | Alexandre Duc, Serge Vaudenay |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://infoscience.epfl.ch/record/187368/files/helen-full.pdf. |
| Collection: | CiteSeerX |
| Subject Terms: | Code-based cryptosystem, learning from parity with noise problem, minimum distance problem |
| Description: | 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. |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.779 http://infoscience.epfl.ch/record/187368/files/helen-full.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.4EB39AB5 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | 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. |
|---|