Actively secure setup for SPDZ
From MaRDI portal
Publication:2072211
DOI10.1007/s00145-021-09416-wzbMath1481.94122OpenAlexW4205351049MaRDI QIDQ2072211
Frederik Vercauteren, Titouan Tanguy, Dragos Rotaru, Nigel P. Smart, Tim Wood
Publication date: 26 January 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09416-w
Related Items
\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation, Highly efficient OT-based multiplication protocols, Scooby: improved multi-party homomorphic secret sharing based on FHE, Scooby: improved multi-party homomorphic secret sharing based on FHE, Improved primitives for MPC over mixed arithmetic-binary circuits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Overdrive: making SPDZ great again
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- High-performance multi-party computation for binary circuits based on oblivious transfer
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Efficient pseudorandom correlation generators: silent OT extension and more
- Joint encryption and message-efficient secure computation
- A Unified Approach to MPC with Preprocessing Using OT
- (Leveled) fully homomorphic encryption without bootstrapping
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Homomorphic Evaluation of the AES Circuit
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Actively Secure OT Extension with Optimal Overhead
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
- Asynchronous Multiparty Computation: Theory and Implementation
- Computing Partitions with Applications to the Knapsack Problem
- A Faster Pseudopolynomial Time Algorithm for Subset Sum
- On the Power of Correlated Randomness in Secure Computation
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - CRYPTO 2003
