A new scale-invariant homomorphic encryption scheme
From MaRDI portal
Publication:781008
DOI10.1016/j.ins.2017.09.012zbMath1436.94074OpenAlexW2752522859WikidataQ121841752 ScholiaQ121841752MaRDI QIDQ781008
Sungwook Kim, Jae Hong Seo, Jin-Su Kim
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.09.012
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomophic Encryption over the Integers Revisited
- Approximate common divisors via lattices
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Batch Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A new scale-invariant homomorphic encryption scheme
