Secure and fault-tolerant voting in distributed systems

IEEE Aerospace Conference Proceedings

Volumn 3, Issue , 2001, Pages 31117-31126

  Hardekopf, Ben ^a   Kwiat, Kevin ^a   Upadhyaya, Shambhu ^b  

^a AIR FORCE RESEARCH LABORATORY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; SECURITY OF DATA; VOTING MACHINES; WIDE AREA NETWORKS;

VOTING PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034855080     PISSN: 1095323X     EISSN: None     Source Type: Journal    
DOI: 10.1109/AERO.2001.931341     Document Type: Article

References (29)

1. NASA denies that hacking endangered shuffle
2. Case Study: The space shuffle primary computer system
3. Fault tolerant parallel processor architecture overview
4. A performance evaluation of the software-implemented fault-tolerance computer
5. The MAFT architecture for distributed fault tolerance
6. Architectural support for designing fault-tolerant open distributed systems
7. Practical byzantine fault tolerance
8. How to securely replicate services
9. The rampart toolkit for building high-integrity services
10. Byzantine Quorum Systems
11. The SecureRing protocols for securing group communication
12. Intrusion tolerance in distributed computing systems
13. The temporal logic of actions
14. Performance analysis of an enhanced-security distributed voting algorithm
15. The byzantine generals problem
16. Weighted voting for replicated data
17. Towards fault-tolerant and secure agentry
18. Unmasking intelligent agents
19. Software Engineering for Fault-Tolerant Systems