Field instruction multiple data
From MaRDI portal
Publication:2170023
DOI10.1007/978-3-031-06944-4_21zbMath1496.94027OpenAlexW4285290892MaRDI QIDQ2170023
Jun Jie Sim, Huaxiong Wang, Enhui Lim, Sze Ling Yeo, Benjamin Hong Meng Tan, Khin Mi Mi Aung
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_21
homomorphic encryptionsingle instruction multiple datareverse multiplication friendly embeddingsfinite extension fields
Uses Software
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- On the concrete hardness of learning with errors
- Amortized complexity of information-theoretically secure MPC revisited
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Faster homomorphic linear transformations in HElib
- Selected areas in cryptography -- SAC 2016. 23rd international conference, St. John's, NL, Canada, August 10--12, 2016. Revised selected papers
- Secure computation with constant communication overhead using multiplication embeddings
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Efficiently processing complex-valued data in homomorphic encryption
- High-precision arithmetic in homomorphic encryption
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption with Polylog Overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Fully homomorphic encryption using ideal lattices
- (Finite) field work: choosing the best encoding of numbers for FHE computation
This page was built for publication: Field instruction multiple data
