HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance ProblemsReportar como inadecuado




HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Presented at: AFRICACRYPT 2013, 6th International Conference on Cryptology in Africa, Cairo, Egypt, June 22-24, 2013 Published in: Proceedings of the 6th International Conference on Cryptology in Africa, vol. 7918, p. 107-126 Series: Lecture Notes in Computer Science 7918 Berlin: Springer, 2013

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.

Keywords: Code-based cryptosystem ; learning from parity with noise problem ; LPN ; minimum distance problem ; random linear code ; public-key cryptosystem Reference EPFL-CONF-187368doi:10.1007/978-3-642-38553-7_6





Autor: Duc, Alexandre; Vaudenay, SergeEditors: Youssef, Amr; Nitaj, Abderrahmane; Hassanien, Aboul Ella

Fuente: https://infoscience.epfl.ch/record/187368?ln=en







Documentos relacionados