Player-Centric Byzantine Agreement
type: Item
instance of: scholarly article
title: Player-Centric Byzantine Agreement
zbMATH Open document ID: 1332.68010
DOI: 10.1007/978-3-642-22006-7_24
author: Martin Hirt
author: Vassilis Zikas
published in: Automata, Languages and Programming
publication date: 2011-07-06T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5917969
MaRDI profile type: Publication
full work available at URL: 978-3-642-22006-7 24
OpenAlex ID: W1881014145
cites work: Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
cites work: Secure Computation Without Authentication
cites work: Q4035678
cites work: MPC vs. SFE: Perfect Security in a Unified Corruption Model
cites work: Efficient Byzantine Agreement with Faulty Minority
cites work: An efficient algorithm for byzantine agreement without authentication
cites work: Efficient player-optimal protocols for strong and differential consensus
cites work: Q4249325
cites work: Q4502503
cites work: Fully polynomial Byzantine agreement in t + 1 rounds
cites work: Authenticated Byzantine Generals in Dual Failure Model
cites work: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
cites work: MPC vs. SFE : Unconditional and Computational Security
cites work: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
cites work: The Byzantine Generals Problem
cites work: Reaching Agreement in the Presence of Faults
cites work: Fast Distributed Agreement
description: scientific article