The complexity of multiparty PSM protocols and related models
type: Item
instance of: scholarly article
title: The complexity of multiparty PSM protocols and related models
zbMATH Open document ID: 1428.94059
DOI: 10.1007/978-3-319-78375-8_10
author: Amos Beimel
author: Eyal Kushilevitz
author: Pnina Nissim
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 6900706
MaRDI profile type: Publication
full work available at URL: 978-3-319-78375-8 10
OpenAlex ID: W2795260699
Recommended article: Multi-Party Protocols, Information Complexity and Privacy
Recommended article: On the message complexity of secure multiparty computation
Recommended article: Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Recommended article: Theory and Practice of Multiparty Computation
Recommended article: The broadcast message complexity of secure multiparty computation
Recommended article: Multiparty communication complexity and very hard functions
Recommended article: Q5090444
Recommended article: Q5002694
Recommended article: Multi-party PSM, revisited: improved communication and unbalanced communication
description: scientific article; zbMATH DE number 6900706