Flexible intrusion tolerant voting architecture

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.

REFERENCES

• 1: David E. Bakken , Zhiyuan Zhan , Christopher C. Jones , David A. Karr, Middleware Support for Voting and Data Fusion, Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS), p.453-462, July 01-04, 2001
• 2: Gabriel Bracha , Sam Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM (JACM), v.32 n.4, p.824-840, Oct. 1985 [doi>10.1145/4221.214134]
• 3: Y. G. Desmedt. Threshold cryptography. In European Trans. on Telecommunications, 1994.
• 4: Y. Deswarte, L. Blain, and J.-C. Fabre. Intrusion tolerance in distributed computing systems. In IEEE Symposium on Security and Privacy, pages 110--121, 1991.
• 5: B. Hardekopf, K. Kwiat, and S. Upadhyaya. Secure and fault-tolerant voting in distributed systems. In IEEE Proceedings of Aerospace Conference 2001, volume 3, pages 1117--1126, 2001.
• 6: Jean-Philippe Etienne Martin , Lorenzo Alvisi, Byzantine fault-tolerance and beyond, University of Texas at Austin, Austin, TX, 2006
• 7: B. Parhami. Voting algorithms. IEEE Transactions on Reliability, 43(4):617--629, 1994.
• 8: Fred B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys (CSUR), v.22 n.4, p.299-319, Dec. 1990 [doi>10.1145/98163.98167]
• 9: Jian Yin , Jean-Philippe Martin , Arun Venkataramani , Lorenzo Alvisi , Mike Dahlin, Separating agreement from execution for byzantine fault tolerant services, Proceedings of the nineteenth ACM symposium on Operating systems principles, October 19-22, 2003, Bolton Landing, NY, USA

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems

General Terms:
Reliability, Security

Keywords:
byzantine fault tolerance, fragmentation-redundancy-scattering, reliable system, threshold cryptography