Actively secure setup for SPDZ
type: Item
instance of: scholarly article
title: Actively secure setup for SPDZ
zbMATH Open document ID: 1481.94122
author: Dragos Rotaru
author: N. P. Smart
author: Titouan Tanguy
author: Frederik Vercauteren
author: Tim Wood
published in: Journal of Cryptology
publication date: 2022-01-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7464310
zbMATH Keywords: MPC
zbMATH Keywords: somewhat homomorphic encryption
zbMATH Keywords: key generation
describes a project that uses: Knapsack
describes a project that uses: MP-SPDZ
describes a project that uses: VIFF
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s00145-021-09416-w
OpenAlex ID: W4205351049
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Fully homomorphic encryption using ideal lattices
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
cites work: Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: MArBLed circuits: mixing arithmetic and Boolean circuits with active security
cites work: Efficient pseudorandom correlation generators: silent OT extension and more
cites work: Q4341753
cites work: Joint encryption and message-efficient secure computation
cites work: Q3149671
cites work: Asynchronous Multiparty Computation: Theory and Implementation
cites work: On the Power of Correlated Randomness in Secure Computation
cites work: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Q4035736
cites work: Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
cites work: Overdrive: making SPDZ great again
cites work: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
cites work: Homomorphic Evaluation of the AES Circuit
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights
cites work: A Faster Pseudopolynomial Time Algorithm for Subset Sum
cites work: Actively Secure OT Extension with Optimal Overhead
cites work: A Unified Approach to MPC with Preprocessing Using OT
cites work: Advances in Cryptology - CRYPTO 2003
cites work: High-performance multi-party computation for binary circuits based on oblivious transfer
cites work: Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
DOI: 10.1007/S00145-021-09416-W
description: scientific article; zbMATH DE number 7464310