000181613 001__ 181613
000181613 005__ 20180913061549.0
000181613 037__ $$aCONF
000181613 245__ $$aHELEN: a Public-key Cryptosystem Based on the LPN Problem (Extended Abstract)
000181613 269__ $$a2012
000181613 260__ $$c2012
000181613 336__ $$aConference Papers
000181613 520__ $$aWe 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.
000181613 6531_ $$aCode-based cryptosystem
000181613 6531_ $$alearning from parity with noise problem
000181613 6531_ $$aminimum distance problem
000181613 6531_ $$arandom linear code
000181613 6531_ $$apublic-key cryptosystem
000181613 700__ $$0246059$$aDuc, Alexandre$$g170854
000181613 700__ $$0241950$$aVaudenay, Serge$$g131602
000181613 7112_ $$aYACC 2012$$cPorquerolles Island, France$$dSeptember 24-28 2012
000181613 8564_ $$s121451$$uhttps://infoscience.epfl.ch/record/181613/files/helen.pdf$$yn/a$$zn/a
000181613 909C0 $$0252183$$pLASEC$$xU10433
000181613 909CO $$ooai:infoscience.tind.io:181613$$pconf$$pIC
000181613 917Z8 $$x194711
000181613 917Z8 $$x170854
000181613 937__ $$aEPFL-CONF-181613
000181613 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000181613 980__ $$aCONF