Abstract
Data and computations for critical services on Internet are replicated and scattered to remote sites for the purpose of both security and fault-tolerance. In order to deliver only secure results to the users, we need an algorithm to decide agreement on results from replicated servers in a secure manner in terms of integrity and confidentiality. For this purpose, a secure and practical decentralized voting algorithm is proposed in the paper. Since a typical Internet user submits a request to a node and obtains the corresponding reply from the same node, we assume a system model in which service requests are preprocessed and corresponding results are delivered by the same coordination nodes called proxies in an asynchronous wide area network. The algorithm employs hashes and digital signatures. The complexity of the algorithm is compared with other competent voting algorithms. In order to demonstrate the performance of the algorithm, experimental result on a test-bed for web service is also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proc. of the 3rd Symposium on Operating System Design and Implementation (Febuary 1999)
Hardekopf, B., Kwiat, K., Upadhyaya, S.: 2001. In: Joint Meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2001) and the 7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001), Orlando, FL, July 22-25 (2001)
Hardekopf, B., Kwiat, K., Upadhyaya, S.: Secure and Fault-Tolerant Voting in Distributed Systems. In: IEEE Aerospace Conference (March 2001)
Lamport, L., et al.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3) (, July 1982)
Min, B.J., et al.: Secure System Architecture based on Dynamic Resource Reallocation. In: Proc. of the 4th Int’l Workshop on Information Security Applications, pp. 199–212 (2003)
Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. Journal of the ACM 27(2), 228–234 (1980)
Randell, B.: Dependability - Unifying Concept. Computer Security, Dependability & Assurance: From Needs to Solutions, ISBN 0-7695-0337-3/99 (1998)
Reynolds, J., et al.: The Design and Implementation of an Intrusion Tolerant System. In: Proc. of Int’l Conference on Dependable Systems and Networks, Washington D.C, June 2002, pp. 258–290 (2002)
Wang, F., et al.: SITAR: A Scalable Intrusion-Tolerant Architecture for Distributed Services. In: Proc. of 2001 IEEE Workshop on Information Assurance and Security US Military Academy, West Point, NY, June 2001, pp. 38–45 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, B.J., Kim, S.K., Im, C. (2004). Committing Secure Results with Replicated Servers. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-24707-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22054-1
Online ISBN: 978-3-540-24707-4
eBook Packages: Springer Book Archive