On the message complexity of secure multiparty computation
type: Item
instance of: scholarly article
title: On the message complexity of secure multiparty computation
zbMATH Open document ID: 1441.94081
DOI: 10.1007/978-3-319-76578-5_24
author: Yuval Ishai
author: Manika Mittal
author: Rafail Ostrovsky
publication date: 2018-05-16T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6869066
MaRDI profile type: Publication
full work available at URL: 978-3-319-76578-5 24
OpenAlex ID: W2793740528
Recommended article: The broadcast message complexity of secure multiparty computation
Recommended article: Q5002694
Recommended article: On the Communication Complexity of Secure Computation
Recommended article: On the complexity of verifiable secret sharing and multiparty computation
Recommended article: Tight bounds on the randomness complexity of secure multiparty computation
Recommended article: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Recommended article: Q2707411
Recommended article: On the (in)efficiency of non-interactive secure multiparty computation
Recommended article: On the (In)Efficiency of Non-Interactive Secure Multiparty Computation
Recommended article: Advances in Cryptology - EUROCRYPT 2004
description: scientific article; zbMATH DE number 6869066