Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2933057.2933100acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract

Published: 25 July 2016 Publication History

Abstract

We present an optimal emulation of a server based regular read/write storage in a synchronous round-free message-passing system that is subject to mobile Byzantine failures and prove that the problem is impossible to solve in asynchronous settings. In a system with n servers implementing a regular register, our construction tolerates faults (or attacks) that can be abstracted by agents that are moved (in an arbitrary and unforeseen manner) by a computationally unbounded adversary from a server to another in order to deviate the server's computation. When a server is infected by an adversarial agent, it behaves arbitrarily until the adversary decides to "move" the agent to another server. We investigate the case where the movements of the mobile Byzantine agents are decided by the adversary and are completely decoupled from the message communication delay. Our emulation spans two awareness models: servers with and without self-diagnosis mechanism. In the first case servers are aware that the mobile Byzantine agent has left and hence they can stop running the protocol until they recover a correct state while in the second case, servers are not aware of their faulty state and continue to run the protocol using an incorrect local state. Our results, proven optimal with respect to the threshold of the tolerated mobile Byzantine faults in the first model, are significantly different from the round-based synchronous models. Another interesting side result of our study is that, contrary to the round-based synchronous consensus implementation for systems prone to mobile Byzantine faults, our storage emulation does not rely on the necessity of a core of correct processes all along the computation. That is, every server in the system can be compromised by the mobile Byzantine agents at some point in the computation. This leads to another interesting conclusion: storage is easier than consensus in synchronous settings, when the system is hit by mobile Byzantine failures.

References

[1]
N. Banu, S. Souissi, T. Izumi, and K. Wada. An improved byzantine agreement algorithm for synchronous systems with mobile faults. International Journal of Computer Applications, 43(22):1--7, April 2012.
[2]
Rida A. Bazzi. Synchronous byzantine quorum systems. Distributed Computing, 13(1):45--52, January 2000.
[3]
François Bonnet, Xavier Défago, Thanh Dang Nguyen, and Maria Potop-Butucaru. Tight bound on mobile byzantine agreement. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings, pages 76--90, 2014.
[4]
Silvia Bonomi, Antonella Del Pozzo, and Maria Potop-Butucaru. Tight self-stabilizing mobile byzantine-tolerant atomic register. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN '16, pages 6:1--6:10, New York, NY, USA, 2016. ACM.
[5]
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Optimal mobile byzantine fault tolerant distributed storage. (Available on line on arXiv), 2016.
[6]
H. Buhrman, J. A. Garay, and J.-H. Hoepman. Optimal resiliency against mobile faults. In Proceedings of the 25th International Symposium on Fault-Tolerant Computing (FTCS'95), pages 83--88, 1995.
[7]
J. A. Garay. Reaching (and maintaining) agreement in the presence of mobile faults. In Proceedings of the 8th International Workshop on Distributed Algorithms, volume 857, pages 253--264, 1994.
[8]
Leslie Lamport. On interprocess communication. part i: Basic formalism. Distributed Computing, 1(2):77--85, 1986.
[9]
Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203--213, October 1998.
[10]
Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Minimal byzantine storage. In Proceedings of the 16th International Conference on Distributed Computing, DISC '02, pages 311--325, London, UK, UK, 2002. Springer-Verlag.
[11]
Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Small byzantine quorum systems. In Dependable Systems and Networks, 2002. DSN 2002. Proceedings. International Conference on, pages 374--383. IEEE, 2002.
[12]
R. Ostrovsky and M. Yung. How to withstand mobile virus attacks (extended abstract). In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (PODC'91), pages 51--59, 1991.
[13]
R. Reischuk. A new solution for the byzantine generals problem. Information and Control, 64(1--3):23--42, January-March 1985.
[14]
T. Sasaki, Y. Yamauchi, S. Kijima, and M. Yamashita. Mobile byzantine agreement on arbitrary network. In Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS'13), pages 236--250, December 2013.
[15]
Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299--319, December 1990.
[16]
Paulo Sousa, Alysson Neves Bessani, Miguel Correia, Nuno Ferreira Neves, and Paulo Verissimo. Highly available intrusion-tolerant services with proactive-reactive recovery. IEEE Transactions on Parallel & Distributed Systems, (4):452--465, 2009.

Cited By

View all
  • (2022)Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestampsTheoretical Computer Science10.1016/j.tcs.2022.11.028Online publication date: Nov-2022
  • (2021)Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing SystemsNetworked Systems10.1007/978-3-030-91014-3_3(36-53)Online publication date: 2-Dec-2021
  • (2021)Blockchains and the CommonsNetworked Systems10.1007/978-3-030-67087-0_3(28-44)Online publication date: 14-Jan-2021
  • Show More Cited By

Index Terms

  1. Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
    July 2016
    508 pages
    ISBN:9781450339643
    DOI:10.1145/2933057
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 25 July 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. mobile byzantine failures
    2. regular register
    3. round free computation

    Qualifiers

    • Research-article

    Funding Sources

    • Ateneo 2015
    • EURASIA

    Conference

    PODC '16
    Sponsor:

    Acceptance Rates

    PODC '16 Paper Acceptance Rate 40 of 149 submissions, 27%;
    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)24
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 12 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestampsTheoretical Computer Science10.1016/j.tcs.2022.11.028Online publication date: Nov-2022
    • (2021)Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing SystemsNetworked Systems10.1007/978-3-030-91014-3_3(36-53)Online publication date: 2-Dec-2021
    • (2021)Blockchains and the CommonsNetworked Systems10.1007/978-3-030-67087-0_3(28-44)Online publication date: 14-Jan-2021
    • (2018)Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded TimestampsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-03232-6_28(398-403)Online publication date: 20-Oct-2018
    • (2017)Optimal Storage under Unsynchronized Mobile Byzantine Faults2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS.2017.20(154-163)Online publication date: Sep-2017

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media