Efficient integer encoding for homomorphic encryption via ring isomorphisms
From MaRDI portal
Publication:2946465
DOI10.1007/978-3-319-16295-9_3zbMATH Open1378.94045OpenAlexW1025324060MaRDI QIDQ2946465FDOQ2946465
Authors: 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
Recommendations
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- Fully homomorphic encryption scheme based on public key compression and batch processing
- Subring homomorphic encryption
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- (Finite) field work: choosing the best encoding of numbers for FHE computation
Cites Work
- Title not available (Why is that?)
- 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
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Better key sizes (and attacks) for LWE-based encryption
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Lattice-based Cryptography
- Fully homomorphic SIMD operations
- Improved security for a ring-based fully homomorphic encryption scheme
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Optimizations for NTRU
- ML confidential: machine learning on encrypted data
Cited In (4)
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Efficiently processing complex-valued data in homomorphic encryption
- (Finite) field work: choosing the best encoding of numbers for FHE computation
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
This page was built for publication: Efficient integer encoding for homomorphic encryption via ring isomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946465)