Cryptology ePrint Archive: Report 2015/013
Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
Abstract: Cryptographic schemes based on the Learning Parity with Noise (LPN) problem have several very desirable aspects: Low computational overhead, simple implementation and conjectured post-quantum hardness. Choosing the LPN noise parameter sufficiently low allows for public key cryptography. In this work, we construct the first standard model public key encryption scheme with key dependent message security based solely on the low noise LPN problem. Additionally, we establish a new connection between LPN with a bounded number of samples and LPN with an unbounded number of samples. In essence, we show that if LPN with a small error and a small number of samples is hard, then LPN with a slightly larger error and an unbounded number of samples is also hard. The key technical ingredient to establish both results is a variant of the LPN problem called the extended LPN problem.
Category / Keywords: public-key cryptography / Low Noise LPN, Key Dependent Message Security, LPN Hardness Reduction
Original Publication (with major differences): IACR-PKC-2015
Date: received 9 Jan 2015, last revised 12 Jan 2015
Contact author: nico doettling at gmail com
Available format(s): PDF | BibTeX Citation
Note: This is the full version of the paper with the same name that will be published in the proceedings of the 18th International Conference on Practice and Theory in Public-Key Cryptography (PKC 2015).
Version: 20150112:101403 (All versions of this report)
Short URL: ia.cr/2015/013
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]