Publication

HELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract)

Serge Vaudenay, Alexandre Raphaël Duc
2012
Conference Papers

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.

Official source

https://infoscience.epfl.ch/entities/publication/19f33916-27a3-42d1-ac9f-d65c4ecf0722

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

HELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract)

Chat with Graph Search

Secure and Efficient Cryptographic Algorithms in a Quantum World

Isogeny Problems with Level Structure

When Your AI Becomes a Target: AI Security Incidents and Best Practices