Direct CCA-secure KEM and deterministic PKE from plain LWE

DOI10.1007/978-3-030-25510-7_7MaRDI QIDQ2302129zbMATH OpenOpenAlexFDO

Authors Xavier Boyen, Qinyi Li

Publication date 25 February 2020

Full work available at URL http://hdl.handle.net/10072/392997

zbMATH Keywords

CCA-secure public-key encapsulation schemePlain Learning with Errors problem

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• A simple and efficient CCA-secure lattice KEM in the standard model
• CCA secure public key encryption scheme based on LWE without Gaussian sampling
• Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices
• Simpler CCA secure PKE from LPN problem without double-trapdoor
• A generic construction of CCA-secure deterministic encryption

Cited in

(8)

• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• CCA-security from adaptive all-but-one lossy trapdoor functions
• A simple and efficient CCA-secure lattice KEM in the standard model
• Tightly secure ring-LWE based key encapsulation with short ciphertexts
• Efficient public-key encryption with equality test from lattices
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model
• CCA secure public key encryption scheme based on LWE without Gaussian sampling

This page was built for publication: Direct CCA-secure KEM and deterministic PKE from plain LWE

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