Must the communication graph of MPC protocols be an expander?
type: Item
instance of: scholarly article
title: Must the communication graph of MPC protocols be an expander?
zbMATH Open document ID: 1457.94005
DOI: 10.1007/978-3-319-96878-0_9
author: Elette Boyle
author: Ran Cohen
author: Deepesh Data
author: Pavel Hubáček
publication date: 2020-06-30T00:00:00Z
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05C48
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 7216149
zbMATH Keywords: Secure multiparty computation on incomplete communication networks
MaRDI profile type: Publication
full work available at URL: 978-3-319-96878-0 9
OpenAlex ID: W2794646065
description: scientific article; zbMATH DE number 7216149