Efficient updatable public-key encryption from lattices
From MaRDI portal
Publication:6604934
DOI10.1007/978-981-99-8733-7_11zbMATH Open1547.94302MaRDI QIDQ6604934
Damien Stehlé, Alain Passelègue, Calvin Abou Haidar
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the concrete hardness of learning with errors
- On the bit security of cryptographic primitives
- A modular analysis of the Fujisaki-Okamoto transformation
- Security analysis and improvements for the IETF MLS standard for group messaging
- Efficient ratcheting: almost-optimal guarantees for secure messaging
- Worst-case to average-case reductions for module lattices
- Updatable public key encryption in the standard model
- (Leveled) fully homomorphic encryption without bootstrapping
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Trapdoors for hard lattices and new cryptographic constructions
- Hierarchical ID-Based Cryptography
- Bi-Deniable Public-Key Encryption
- Advances in Cryptology - CRYPTO 2003
- Classical hardness of learning with errors
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Efficient lattice-based inner-product functional encryption
- Lattice-Based Secure Biometric Authentication for Hamming Distance
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)
