Simpler CCA secure PKE from LPN problem without double-trapdoor
From MaRDI portal
Publication:2218992
DOI10.1007/978-3-030-01950-1_46zbMath1458.94224OpenAlexW2898362257MaRDI QIDQ2218992
Haifeng Qian, Haitao Cheng, Di Yan, Xiang-Xue Li
Publication date: 18 January 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-01950-1_46
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (2)
A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
This page was built for publication: Simpler CCA secure PKE from LPN problem without double-trapdoor