HELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract)
Uloženo v:
| Název: | HELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract) |
|---|---|
| Autoři: | Duc, Alexandre, Vaudenay, Serge |
| Rok vydání: | 2012 |
| Sbírka: | Ecole Polytechnique Fédérale Lausanne (EPFL): Infoscience |
| Témata: | Code-based cryptosystem, learning from parity with noise problem, minimum distance problem, random linear code, public-key cryptosystem |
| Popis: | 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. ; LASEC |
| Druh dokumentu: | conference object |
| Jazyk: | unknown |
| Relation: | https://infoscience.epfl.ch/record/181613/files/helen.pdf; YACC 2012; https://infoscience.epfl.ch/handle/20.500.14299/85892 |
| Dostupnost: | https://infoscience.epfl.ch/handle/20.500.14299/85892 https://hdl.handle.net/20.500.14299/85892 |
| Přístupové číslo: | edsbas.CB2E631C |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | 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. ; LASEC |
|---|