Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
From MaRDI portal
Publication:2170012
DOI10.1007/978-3-031-06944-4_18zbMath1496.94034OpenAlexW3202295763MaRDI QIDQ2170012
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_18
secure multi-party computationhomomorphic encryptionpacking method\(\mathbb{Z}_{p^k}\)polynomial packing methodreverse multiplication-friendly embedding
Uses Software
Cites Work
- Amortized complexity of information-theoretically secure MPC revisited
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- 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
- Overdrive: making SPDZ great again
- Secure computation based on leaky correlations: high resilience setting
- Secure computation with constant communication overhead using multiplication embeddings
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Constant-overhead unconditionally secure multiparty computation over binary fields
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- On the complexity of arithmetic secret sharing
- 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
- High-precision arithmetic in homomorphic encryption
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- 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
- Algorithms in HElib
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Better Bootstrapping in Fully Homomorphic Encryption
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Bootstrapping for HElib
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Fully homomorphic encryption using ideal lattices
This page was built for publication: Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
