Flexible intrusion tolerant voting architecture

Authors:
Soontaree Tanaraksiritavorn;Shivakant Mishra
Affiliations:
University of Colorado;University of Colorado
Venue:
Proceedings of the 2007 ACM workshop on Scalable trusted computing
Year:
2007

Citing 5
Cited 0

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Middleware Support for Voting and Data Fusion

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Separating agreement from execution for byzantine fault tolerant services

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Byzantine fault-tolerance and beyond

Byzantine fault-tolerance and beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose to design and implement a voting architecture that efficiently tolerates byzantine failure, supports inexact matching of inputs, and preserves privacy. Its functionality includes integrating replies from different correct servers whose data may differ slightly from one another due to environmental factors, filtering out replies from faulty servers to protect any intentional or unintentional leakage of confidential data, and dynamically adapting to different applications by incorporating new rules. We also explore how to distribute replies and cryptographic key so that a compromised voter would reveal only a partial key or partial replies.