Abstract
Distributed protocols resilient to Byzantine failures are notorious to be costly from the computational and communication point of view. In this paper we discuss the role that collision–resistant hash functions can have in enhancing the efficiency of Byzantine–tolerant coordination protocols. In particular, we show two settings in which their use leads to a remarkable improvement of the system performance in case of large data or large populations. More precisely, we show how they can be applied to the implementation of atomic shared objects, and propose a technique that combines randomization and hash functions. We discuss also the earnings of these approaches and compute their complexity.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chockler, G., Malkhi, D., Reiter, M.: Back-off protocols for distributed mutual exclusion and ordering. In: Proc. of the 21st International Conference on Distributed Systems, pp. 11–20 (April 2001)
Tulone, D.: On the Efficiency of Ordering Operations with Arbitrary Failures. CNR ISTI Technical Report (April 2003)
Malkhi, D., Reiter, M., Wool, A.: The load and availability of Byzantine Quorum Systems. SIAM Journal on Computing 29(6), 1889–1906 (2000)
Malkhi, D., Reiter, M.K., Tulone, D., Ziskind, E.: Persistent objects in the Fleet system. In: Proc. of the 2nd Darpa Information Survivability Conference and Exposition (DISCEX II) (June 2001)
Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems (TOCS) 20(4), 398–461 (2002)
Reiter, M.K.: Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In: Proc. of the 2nd ACM Conference on Computer and Communication Security, Novemebr 1994, pp. 68–80 (1994)
Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: The Secure Ring Protocols for Securing Group Communication. In: Proc. of the IEEE 31st Hawaii International Conference on System Sciences, January 1998, vol. 3, pp. 317–326 (1998)
Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proc. of the 21st ACM symposium on Principles of Distributed Computing (PODC 2002), July 2002, pp. 78–87 (2002)
Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems (TOCS) 16(2), 133–169 (1998)
Herley, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)
Krawczyk, H.: Distributed fingerprints and secure information dispersal. In: Proc. of the 12th annual ACM symposium on Principles of distributed computing (PODC 2002) (September 1993)
Broder, A., Mitzenmacher, M.: Using Multiple Hash Functions to Improve IP Lookups. In: Proc. of IEEE INFOCOM 2001, April 2001, pp. 1454–1463 (2001)
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. Proc. of the 29th annual ACM symposium on Theory of computing (STOC 1997) (May 1997)
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
Tulone, D. (2004). Enhancing Efficiency of Byzantine-Tolerant Coordination Protocols via Hash Functions. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive