Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification

DOI10.1007/978-3-662-46447-2_27zbMath1345.94057OpenAlexW632084191MaRDI QIDQ2941212

Nico Döttling

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46447-2_27

zbMATH Keywords

key dependent message securitylow noise LPNLPN hardness reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Batch-OT with optimal rate ⋮ CPA-to-CCA transformation for KDM security ⋮ On the asymptotic complexity of solving LWE ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Towards efficient LPN-based symmetric encryption ⋮ Secure hybrid encryption in the standard model from hard learning problems

This page was built for publication: Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification