Simple Chosen-Ciphertext Security from Low-Noise LPN
From MaRDI portal
Publication:5402961
DOI10.1007/978-3-642-54631-0_1zbMath1335.94059OpenAlexW1591026455WikidataQ59163673 ScholiaQ59163673MaRDI QIDQ5402961
Daniel Masny, Eike Kiltz, Krzysztof Pietrzak
Publication date: 25 March 2014
Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_1
Related Items (13)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ How to build a trapdoor function from an encryption scheme ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ Towards efficient LPN-based symmetric encryption ⋮ Secure hybrid encryption in the standard model from hard learning problems
This page was built for publication: Simple Chosen-Ciphertext Security from Low-Noise LPN
