Tight bound on mobile Byzantine agreement
type: Item
instance of: scholarly article
title: Tight bound on mobile Byzantine agreement
zbMATH Open document ID: 1331.68030
author: François Bonnet
author: Xavier Défago
author: Thanh Dang Nguyen
author: Maria Potop-Butucaru
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6517452
zbMATH Keywords: distributed agreement
zbMATH Keywords: Byzantine fault tolerance
zbMATH Keywords: mobile faults
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.10.019
OpenAlex ID: W1773531469
cites work: The Byzantine Generals Problem
cites work: Reaching Agreement in the Presence of Faults
cites work: An efficient algorithm for byzantine agreement without authentication
cites work: Efficient algorithms for anonymous Byzantine agreement
cites work: An O (log n ) expected rounds randomized byzantine generals protocol
cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
cites work: Time is not a healer
cites work: Structural Information and Communication Complexity
cites work: Impossibility Results and Lower Bounds for Consensus under Link Failures
cites work: Impossibility of distributed consensus with one faulty process
cites work: A new solution for the Byzantine generals problem
cites work: How to withstand mobile virus attacks (extended abstract)
cites work: The Byzantine generals strike again
cites work: Self-stabilizing byzantine agreement
DOI: 10.1016/J.TCS.2015.10.019
description: scientific article; zbMATH DE number 6517452