Secure multiparty computation with sublinear preprocessing
From MaRDI portal
Publication:2170009
DOI10.1007/978-3-031-06944-4_15zbMath1496.94029OpenAlexW4285141307MaRDI QIDQ2170009
Ariel Nof, Niv Gilboa, Elette Boyle, Yuval Ishai
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_15
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Probabilistic encryption
- Overdrive: making SPDZ great again
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Secure computation with constant communication overhead using multiplication embeddings
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Security and composition of multiparty cryptographic protocols
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Efficient pseudorandom correlation generators from ring-LPN
- Sublinear GMW-style compiler for MPC with preprocessing
- Secure computation with preprocessing via function secret sharing
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient fully secure computation via distributed zero-knowledge proofs
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Threshold Cryptosystems Based on Factoring
- Foundations of Cryptography
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- On the Power of Correlated Randomness in Secure Computation
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Arithmetic Software Libraries
- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
- Communication preserving protocols for secure function evaluation
- Circuits resilient to additive attacks with applications to secure computation
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Secure multiparty computation with sublinear preprocessing
