Efficient updatable public-key encryption from lattices

DOI10.1007/978-981-99-8733-7_11MaRDI QIDQ6604934zbMATH OpenFDO

Authors Calvin Abou Haidar, Alain Passelègue, Damien Stehlé

Publication date 13 September 2024

zbMATH Keywords

LWE-based UPKE schemeupdatable key encapsulation mechanism

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Updatable public-key encryption, revisited
• Updatable public key encryption in the standard model
• Towards post-quantum key-updatable public-key encryption via supersingular isogenies
• Fast and secure updatable encryption

Cites work

• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 2009960 (Why is no real title available?)
• scientific article; zbMATH DE number 2086721 (Why is no real title available?)
• scientific article; zbMATH DE number 2086725 (Why is no real title available?)
• scientific article; zbMATH DE number 1842500 (Why is no real title available?)
• scientific article; zbMATH DE number 1418310 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A modular analysis of the Fujisaki-Okamoto transformation
• Advances in Cryptology - CRYPTO 2003
• Bi-deniable public-key encryption
• Classical hardness of learning with errors
• Efficient lattice-based inner-product functional encryption
• Efficient public-key cryptography in the presence of key leakage
• Efficient ratcheting: almost-optimal guarantees for secure messaging
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Hierarchical ID-Based Cryptography
• Lattice-Based Secure Biometric Authentication for Hamming Distance
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• On the bit security of cryptographic primitives
• On the concrete hardness of learning with errors
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Security analysis and improvements for the IETF MLS standard for group messaging
• Trapdoors for hard lattices and new cryptographic constructions
• Updatable public key encryption in the standard model
• Worst-case to average-case reductions for module lattices

Cited in

(2)

• Towards post-quantum key-updatable public-key encryption via supersingular isogenies
• Updatable public-key encryption, revisited

This page was built for publication: Efficient updatable public-key encryption from lattices

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