Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms
From MaRDI portal
Publication:2946465
DOI10.1007/978-3-319-16295-9_3zbMath1378.94045OpenAlexW1025324060MaRDI QIDQ2946465
Matthias Geihs, Daniel Cabarcas
Publication date: 17 September 2015
Published in: Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16295-9_3
Related Items (2)
Efficiently processing complex-valued data in homomorphic encryption ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
Cites Work
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Better Bootstrapping in Fully Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Faster Fully Homomorphic Encryption
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-based Cryptography
- ML Confidential: Machine Learning on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms