Detecting causality in the presence of Byzantine processes: the case of synchronous systems
From MaRDI portal
Publication:6647755
DOI10.1016/J.IC.2024.105212MaRDI QIDQ6647755
Anshuman Misra, Ajay D. Kshemkalyani
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
synchronizationcausalitydistributed algorithmsynchronous systemByzantine fault-tolerancemessage-passing``happened before relation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data-stream-based global event monitoring using pairwise interactions
- Temporal interactions of intervals in distributed systems.
- Asynchronous byzantine agreement protocols
- A framework for viewing atomic events in distributed computations
- Concerning the size of logical clocks in distributed systems
- An efficient implementation of vector clocks
- Detecting causal relationships in distributed computations: In search of the holy grail
- Reasoning about causality between distributed nonatomic events
- Securing threshold cryptosystems against chosen ciphertext attack
- Authenticated Algorithms for Byzantine Agreement
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Time, clocks, and the ordering of events in a distributed system
- Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
- Orthogonal relations for reasoning about posets
- The power of logical clock abstractions
- Brief announcement
- Distributed Computing
This page was built for publication: Detecting causality in the presence of Byzantine processes: the case of synchronous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647755)
