Abstract
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzantine Quorum Systems protocol that provides atomic semantics despite the existence of Byzantine clients and servers. Moreover, this protocol is integrated with a protocol for proactive recovery of servers. In that way, the system tolerates any number of failures during its lifetime, since no more than f out of n servers fail during a small interval of time between recoveries. All solutions proposed in this paper can be used on asynchronous systems, which requires no time assumptions. The proposed quorum system read and write protocols have been implemented and their efficiency is demonstrated through some experiments carried out in the Emulab platform.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amir, Y., Danilov, C., Kirsch, J., Lane, J., Dolev, D., Nita-Rotaru, C., Olsen, J., Zage, D.: Scaling Byzantine fault-tolerant replication to wide area networks. In: Proc. of the International Conference on Dependable Systems and Networks, pp. 105–114 (2006)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. of the 1st ACM Conference on Computer and Communications Security, November 1993, pp. 62–73 (1993)
Bessani, A., Daidone, A., Gashi, I., Obelheiro, R., Sousa, P., Stankovic, V.: Enhancing fault/intrusion tolerance through design and configuration diversity. In: Proc. of the 3rd Workshop on Recent Advances on Intrusion-Tolerant Systems (June 2009)
Castro, M., Liskov, B.: Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions on Computer Systems 20(4), 398–461 (2002)
Correia, R., Sousa, P.: WEST: Wormhole-enhanced state transfer. In: Proc. of the DSN 2009 Workshop on Proactive Failure Avoidance, Recovery and Maintenance, PFARM (June 2009)
Dantas, W.S., Bessani, A.N., da Silva F.J., Correia, M.: Evaluating Byzantine quorum systems. In: Proc. of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)
Gifford, D.: Weighted voting for replicated data. In: Proc. of the 7th ACM Symposium on Operating Systems Principles, December 1979, pp. 150–162 (1979)
Lamport, L.: On interprocess communication (part II). Distributed Computing 1(1), 203–213 (1986)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programing Languages and Systems 4(3), 382–401 (1982)
Liskov, B., Rodrigues, R.: Tolerating Byzantine faulty clients in a quorum system. In: Proc. of the 26th IEEE International Conference on Distributed Computing Systems (June 2006)
Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203–213 (1998)
Malkhi, D., Reiter, M.: Secure and scalable replication in Phalanx. In: Proc. of 17th Symposium on Reliable Distributed Systems, pp. 51–60 (1998)
Marsh, M.A., Schneider, F.B.: CODEX: A robust and secure secret distribution system. IEEE Transactions on Dependable Secure Computing 1(1), 34–47 (2004)
Obelheiro, R.R., Bessani, A.N., Lung, L.C., Correia, M.: How practical are intrusion-tolerant distributed systems? DI-FCUL TR 06–15, Dep. of Informatics, University of Lisbon (September 2006)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–222. Springer, Heidelberg (2000)
Sousa, P., Bessani, A.N., Correia, M., Neves, N.F., Verissimo, P.: Highly available intrusion-tolerant services with proactive-reactive recovery. IEEE Transactions on Parallel and Distributed Systems (to appear)
Sousa, P., Neves, N.F., Verissimo, P.: How resilient are distributed f fault/intrusion-tolerant systems? In: Proceedings of the International Conference on Dependable Systems and Networks - DSN 2005 (2005)
Trusted Computing Group. Trusted platform module web page (2009), https://www.trustedcomputinggroup.org/groups/tpm/
White, B., Lepreau, J., Stoller, L., Ricci, R., Guruprasad, S., Newbold, M., Hibler, M., Barb, C., Joglekar, A.: An integrated experimental environment for distributed systems and networks. In: Proc. of 5th Symposium on Operating Systems Design and Implementations (December 2002)
Zhou, L., Schneider, F., Van Rennesse, R.: COCA: A secure distributed online certification authority. ACM Transactions on Computer Systems 20(4), 329–368 (2002)
Zhou, L., Schneider, F.B., Van Renesse, R.: APSS: proactive secret sharing in asynchronous systems. ACM Transactions on Information and System Security 8(3), 259–286 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alchieri, E.A.P., Bessani, A.N., Pereira, F.C., da Silva Fraga, J. (2009). Proactive Byzantine Quorum Systems. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05148-7_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-05148-7_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05147-0
Online ISBN: 978-3-642-05148-7
eBook Packages: Computer ScienceComputer Science (R0)