Tight bounds for shared memory systems accessed by Byzantine processes

DOI10.1007/S00446-005-0125-8zbMath1264.68084DBLPjournals/dc/AlonMRTW05OpenAlexW2006972261WikidataQ59701086 ScholiaQ59701086MaRDI QIDQ1953641

Michael Merritt, Noga Alon, Gadi Taubenfeld, Omer Reingold

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-005-0125-8

zbMATH Keywords

Byzantine agreementdistributed consensuskeywords shared memorysticky bits

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (1)

Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

Uses Software

• JSR-166

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple proof of a simple consensus algorithm
• Wait-free Byzantine consensus.
• Fault-tolerant wait-free shared objects
• On the space complexity of randomized synchronization
• Impossibility of distributed consensus with one faulty process
• Contention in shared memory algorithms
• Computing with faulty shared objects
• Randomized wait-free concurrent objects (extended abstract)
• An Optimistic Approach to Lock-Free FIFO Queues

This page was built for publication: Tight bounds for shared memory systems accessed by Byzantine processes