Efficient player-optimal protocols for strong and differential consensus

DOI10.1145/872035.872066zbMath1321.68043OpenAlexW1991476961MaRDI QIDQ2943757

Matthias Fitzi, Juan A. Garay

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/872035.872066

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (12)

On the round complexity of randomized Byzantine agreement ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Round-optimal Byzantine agreement ⋮ Quick order fairness ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Perfect MPC over layered graphs ⋮ On the Validity of Consensus ⋮ Player-Centric Byzantine Agreement ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Probabilistic termination and composability of cryptographic protocols

Cites Work

• Unnamed Item

This page was built for publication: Efficient player-optimal protocols for strong and differential consensus