Unreliable intrusion detection in distributed computations
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) timePublished by Association for Computing Machinery (ACM) ,1996
- Randomization and failure detection: A hybrid approach to solve ConsensusPublished by Springer Nature ,1996
- “Γ-accurate” failure detectorsPublished by Springer Nature ,1996
- Securing Causal Relationships in Distributed SystemsThe Computer Journal, 1995
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocolsInformation Processing Letters, 1990
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985