Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based
From MaRDI portal
Publication:2980857
DOI10.1007/978-3-319-54705-3_14zbMath1404.94089OpenAlexW2593619422MaRDI QIDQ2980857
Zengpeng Li, Eduardo Morais, Gang Du, Chun-Guang Ma
Publication date: 5 May 2017
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_14
Uses Software
Cites Work
- Unnamed Item
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- A Framework for Efficient and Composable Oblivious Transfer
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
- Batch Fully Homomorphic Encryption over the Integers
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- ASYMPTOTIC PROPERTIES OF THE MAXIMUM LIKELIHOOD ESTIMATOR FOR STOCHASTIC PARABOLIC EQUATIONS WITH ADDITIVE FRACTIONAL BROWNIAN MOTION
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based