The price of low communication in secure multi-party computation
type: Item
instance of: scholarly article
title: The price of low communication in secure multi-party computation
zbMATH Open document ID: 1407.94107
DOI: 10.1007/978-3-319-63688-7_14
author: Yuval Ishai
author: Rafail Ostrovsky
author: Vassilis Zikas
author: Juan Garay
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6802620
MaRDI profile type: Publication
full work available at URL: 978-3-319-63688-7 14
OpenAlex ID: W2734148541
Recommended article: On the message complexity of secure multiparty computation
Recommended article: Lower bounds on the multiparty communication complexity
Recommended article: Secure Two-Party Computation with Low Communication
Recommended article: Communication and Randomness Lower Bounds for Secure Computation
Recommended article: Q5002694
Recommended article: On communication protocols that compute almost privately
Recommended article: On Communication Protocols That Compute Almost Privately
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: On the Communication Complexity of Secure Computation
description: scientific article; zbMATH DE number 6802620