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: | Duc, Alexandre, Vaudenay, Serge |
| Contributors: | Youssef, Amr, Nitaj, Abderrahmane, Hassanien, Aboul Ella |
| Publisher Information: | Springer Berlin |
| Publication Year: | 2013 |
| Collection: | Ecole Polytechnique Fédérale Lausanne (EPFL): Infoscience |
| Subject Terms: | Code-based cryptosystem, learning from parity with noise problem, LPN, minimum distance problem, random linear code, public-key cryptosystem |
| 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. ; LASEC |
| Document Type: | conference object |
| Language: | unknown |
| ISBN: | 978-3-642-38552-0 3-642-38552-4 |
| Relation: | https://infoscience.epfl.ch/record/187368/files/helen-full.pdf; Proceedings of the 6th International Conference on Cryptology in Africa; Lecture Notes in Computer Science; 7918; AFRICACRYPT 2013, 6th International Conference on Cryptology in Africa; https://infoscience.epfl.ch/handle/20.500.14299/93139 |
| DOI: | 10.1007/978-3-642-38553-7_6 |
| Availability: | https://doi.org/10.1007/978-3-642-38553-7_6 https://infoscience.epfl.ch/handle/20.500.14299/93139 https://hdl.handle.net/20.500.14299/93139 |
| Accession Number: | edsbas.301DB164 |
| 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. ; LASEC |
|---|---|
| ISBN: | 9783642385520 3642385524 |
| DOI: | 10.1007/978-3-642-38553-7_6 |