Fairness versus guaranteed output delivery in secure multiparty computation
type: Item
instance of: scholarly article
title: Fairness versus guaranteed output delivery in secure multiparty computation
zbMATH Open document ID: 1386.94067
author: Ran Cohen
author: Yehuda Lindell
published in: Journal of Cryptology
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6839571
zbMATH Keywords: secure multiparty computation
zbMATH Keywords: theoretic foundations
zbMATH Keywords: identifiable abort
zbMATH Keywords: complete fairness
zbMATH Keywords: guaranteed output delivery
zbMATH Keywords: broadcast
MaRDI profile type: Publication
full work available at URL: s00145-016-9245-5
OpenAlex ID: W606919767
cites work: Security against covert adversaries: Efficient protocols for realistic adversaries
cites work: Towards Characterizing Complete Fairness in Secure Two-Party Computation
cites work: Q4035733
cites work: Security and composition of multiparty cryptographic protocols
cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
cites work: Reaching Agreement in the Presence of Faults
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Detectable byzantine agreement secure against faulty majorities
cites work: Q4737266
cites work: Q3549726
cites work: Complete Fairness in Multi-party Computation without an Honest Majority
cites work: Q4279565
cites work: Secure multi-party computation without agreement
cites work: Foundations of Cryptography
cites work: The Byzantine Generals Problem
cites work: Unconditional Byzantine agreement for any number of faulty processors
DOI: 10.1007/S00145-016-9245-5
description: scientific article; zbMATH DE number 6839571