IND-CCA secure cryptography based on a variant of the LPN problem

DOI10.1007/978-3-642-34961-4_30MaRDI QIDQ4911603zbMATH OpenOpenAlexFDO

Authors Nico Döttling, Joern Mueller-Quade, Anderson 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

all-but-one decryptionIND-CCA2 securitylearning parity with noise

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cramer-Shoup like chosen ciphertext security from LPN
• Simple chosen-ciphertext security from low-noise LPN
• Simpler CCA secure PKE from LPN problem without double-trapdoor
• How to Encrypt with the LPN Problem
• Cryptography with auxiliary input and trapdoor from constant-noise LPN

Cited in

(25)

• Cramer-Shoup like chosen ciphertext security from LPN
• STP-LWE: A variant of learning with error for a flexible encryption
• CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
• Chosen ciphertext security from injective trapdoor functions
• Towards efficient LPN-based symmetric encryption
• D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
• Simpler CCA secure PKE from LPN problem without double-trapdoor
• On solving LPN using BKW and variants, Implementation and analysis
• Cryptography with auxiliary input and trapdoor from constant-noise LPN
• An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
• Optimization of \(\mathsf {LPN}\) solving algorithms
• Approximate-deterministic public key encryption from hard learning problems
• scientific article; zbMATH DE number 6966248 (Why is no real title available?)
• HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems
• Simple chosen-ciphertext security from low-noise LPN
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• CCA secure public key encryption scheme based on LWE without Gaussian sampling
• CCA security and trapdoor functions via key-dependent-message security
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
• Lossy cryptography from code-based assumptions
• Non-interactive zero-knowledge from LPN and MQ
• Public-key encryption with filtered equality test against adaptive chosen-ciphertext attacks
• Somewhat homomorphic encryption from linear homomorphism and sparse LPN
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• A minrank-based encryption scheme à la Alekhnovich-Regev

This page was built for publication: IND-CCA secure cryptography based on a variant of the LPN problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911603)