IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

DOI10.1007/978-3-642-34961-4_30zbMath1292.94056OpenAlexW152516429MaRDI QIDQ4911603

Nico Döttling, Jörn Müller-Quade, Anderson C. A. Nascimento

Publication date: 19 March 2013

Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_30

zbMATH Keywords

learning parity with noiseIND-CCA2 securityall-but-one decryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

On solving LPN using BKW and variants, Implementation and analysis ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ STP-LWE: A variant of learning with error for a flexible encryption ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ Towards efficient LPN-based symmetric encryption

This page was built for publication: IND-CCA Secure Cryptography Based on a Variant of the LPN Problem