An efficient passive-to-active compiler for honest-majority MPC over rings
type: Item
instance of: scholarly article
title: An efficient passive-to-active compiler for honest-majority MPC over rings
zbMATH Open document ID: 1490.68077
DOI: 10.1007/978-3-030-78375-4_6
author: M. Abspoel
author: Anders Dalskov
author: Ariel Nof
author: Daniel E. Escudero
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7493507
describes a project that uses: Sharemind
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: 978-3-030-78375-4 6
OpenAlex ID: W2990913254
cites work: Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
cites work: Theory of Cryptography
cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs
cites work: Security and composition of multiparty cryptographic protocols
cites work: Amortized complexity of information-theoretically secure MPC revisited
cites work: Improved Primitives for Secure Multiparty Integer Computation
cites work: Fast large-scale honest-majority MPC for malicious adversaries
cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Scalable and Unconditionally Secure Multiparty Computation
cites work: Yet another compiler for active security or: efficient MPC over arbitrary rings
cites work: Q6059364
cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
cites work: Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
cites work: Circuits resilient to additive attacks with applications to secure computation
cites work: Foundations of Cryptography
cites work: Secure multi-party computation without agreement
cites work: Communication-efficient unconditional MPC with guaranteed output delivery
cites work: Guaranteed output delivery comes free in honest majority MPC
cites work: Field extension in secret-shared form and its applications to efficient secure computation
cites work: Minimising communication in honest-majority MPC by batchwise multiplication verification
description: scientific article; zbMATH DE number 7493507