Proactive secure multiparty computation with a dishonest majority
type: Item
instance of: scholarly article
title: Proactive secure multiparty computation with a dishonest majority
zbMATH Open document ID: 1444.94065
DOI: 10.1007/978-3-319-98113-0_11
author: Karim Eldefrawy
author: Rafail Ostrovsky
author: Sunoo Park
author: Moti Yung
publication date: 2018-10-17T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6957554
MaRDI profile type: Publication
full work available at URL: 978-3-319-98113-0 11
OpenAlex ID: W2887860185
Recommended article: Adaptively Secure Multi-Party Computation with Dishonest Majority
Recommended article: Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Recommended article: Bounded-concurrent secure multi-party computation with a dishonest majority
Recommended article: Verifiable Computation in Multiparty Protocols with Honest Majority
Recommended article: Round-optimal secure multiparty computation with honest majority
Recommended article: Dishonest Majority Multi-Party Computation for Binary Circuits
Recommended article: Secure massively parallel computation for dishonest majority
Recommended article: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Recommended article: Proactive Secret Sharing with a Dishonest Majority
Recommended article: Brief Announcement
description: scientific article; zbMATH DE number 6957554