Characterization of secure multiparty computation without broadcast
type: Item
instance of: scholarly article
title: Characterization of secure multiparty computation without broadcast
zbMATH Open document ID: 1444.94056
author: Ran Cohen
author: Iftach Haitner
author: Eran Omri
author: Lior Rotem
published in: Journal of Cryptology
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6875424
zbMATH Keywords: broadcast
zbMATH Keywords: point-to-point communication
zbMATH Keywords: multiparty computation
zbMATH Keywords: coin flipping
zbMATH Keywords: fairness
zbMATH Keywords: impossibility result
MaRDI profile type: Publication
full work available at URL: s00145-017-9264-x
OpenAlex ID: W3157356141
cites work: Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
cites work: Protocols for multiparty coin toss with a dishonest majority
cites work: Fair Coin Flipping: Tighter Analysis and the Many-Party Case
cites work: Secure multi-party computation without agreement
cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
cites work: Characterization of Secure Multiparty Computation Without Broadcast
cites work: From fairness to full security in multiparty computation
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Easy impossibility proofs for distributed consensus problems
cites work: Detectable byzantine agreement secure against faulty majorities
cites work: Q4434868
cites work: Foundations of Cryptography
cites work: Complete Fairness in Multi-party Computation without an Honest Majority
cites work: An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
cites work: The Weak Byzantine Generals Problem
cites work: The Byzantine Generals Problem
cites work: An Optimally Fair Coin Toss
cites work: Reaching Agreement in the Presence of Faults
cites work: Unconditional Byzantine agreement for any number of faulty processors
DOI: 10.1007/S00145-017-9264-X
Recommended article: Characterization of Secure Multiparty Computation Without Broadcast
Recommended article: An efficient approach for secure multi-party computation without authenticated channel
Recommended article: Secure multi-party computation without agreement
Recommended article: Secure multiparty computations without computers
Recommended article: Non-Interactive Secure Multiparty Computation
Recommended article: The broadcast message complexity of secure multiparty computation
Recommended article: Q5215785
Recommended article: An efficient construction of non-interactive secure multiparty computation
Recommended article: Multiparty Computations in Non-private Environments
Recommended article: An Efficient Framework for Unconditionally Secure Multiparty Computation
description: scientific article; zbMATH DE number 6875424