Constant-overhead unconditionally secure multiparty computation over binary fields
type: Item
instance of: scholarly article
title: Constant-overhead unconditionally secure multiparty computation over binary fields
DOI: 10.1007/978-3-030-77886-6_28
author: Antigoni Polychroniadou
author: Yifan Song
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440628
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 28
OpenAlex ID: W3109351938
cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs
cites work: Q3212258
cites work: Efficient fully secure computation via distributed zero-knowledge proofs
cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
cites work: Perfectly-Secure MPC with Linear Communication Complexity
cites work: Amortized complexity of information-theoretically secure MPC revisited
cites work: Fast large-scale honest-majority MPC for malicious adversaries
cites work: Scalable and Unconditionally Secure Multiparty Computation
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
cites work: Circuits resilient to additive attacks with applications to secure computation
cites work: Communication-efficient unconditional MPC with guaranteed output delivery
cites work: Guaranteed output delivery comes free in honest majority MPC
cites work: The price of active security in cryptographic protocols
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Minimising communication in honest-majority MPC by batchwise multiplication verification
cites work: How to share a secret
description: scientific article; zbMATH DE number 7440628