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. © Springer-Verlag 2004.
CITATION STYLE
Tulone, D. (2004). Enhancing efficiency of byzantine-tolerant coordination protocols via hash functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 587–595. https://doi.org/10.1007/978-3-540-27866-5_77
Mendeley helps you to discover research relevant for your work.