Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
type: Item
instance of: scholarly article
title: Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
zbMATH Open document ID: 1447.94042
DOI: 10.1007/978-3-030-03332-3_4
author: Carmit Hazay
author: Emmanuela Orsini
author: Peter Scholl
author: Eduardo Soria-Vazquez
publication date: 2019-01-23T00:00:00Z
full work available at URL: https://zenodo.org/record/2594595
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005635
MaRDI profile type: Publication
OpenAlex ID: W2898400318
cites work: Secure Multiparty Computation Goes Live
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Perfectly-Secure MPC with Linear Communication Complexity
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: A Unified Approach to MPC with Preprocessing Using OT
cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
cites work: TinyKeys: a new approach to efficient multi-party computation
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Actively Secure OT Extension with Optimal Overhead
cites work: Overdrive: making SPDZ great again
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Dishonest Majority Multi-Party Computation for Binary Circuits
cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Faster Secure Two-Party Computation in the Single-Execution Setting
cites work: Two Halves Make a Whole
Recommended article: MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
Recommended article: Simple and Efficient Perfectly-Secure Asynchronous MPC
Recommended article: On actively-secure elementary MPC reductions
Recommended article: High throughput secure MPC over small population in hybrid networks (extended abstract)
Recommended article: Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
Recommended article: On communication-efficient asynchronous MPC with adaptive security
Recommended article: Yet another compiler for active security or: efficient MPC over arbitrary rings
Recommended article: On fully secure MPC with solitary output
Recommended article: Adaptively secure MPC with sublinear communication complexity
description: scientific article; zbMATH DE number 7005635