Towards a Theory of Consistency Primitives

DOI10.1007/978-3-540-30186-8_27MaRDI QIDQ5464204zbMATH OpenOpenAlexFDO

Authors Ueli M. Maurer

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_27

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Impossibility of distributed consensus with one faulty process
• From partial consistency to global broadcast
• Broadcast amplification
• Asynchronous consensus and broadcast protocols
• Byzantine agreement given partial broadcast

Cited in

(6)

• Synchronous, with a chance of partition tolerance
• On the inherent weakness of conditional primitives
• Towards an arithmetic theory of consistency enforcement based on preservation of -constraints
• Secure Protocols with Asymmetric Trust
• ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
• Strong Separations Between Broadcast and Authenticated Channels

This page was built for publication: Towards a Theory of Consistency Primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464204)