Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Invited Talk: Resilient Distributed Algorithms

  • Conference paper
  • First Online:
SOFSEM 2021: Theory and Practice of Computer Science (SOFSEM 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12607))

  • 1166 Accesses

Abstract

Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependence on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as, the Bitcoin network and cloud computing, introduce in addition, new security challenges that deserve urgent attention in both theory and practice.

This extended abstract describes our initial steps towards developing a unified framework for obtaining fast, resilient and secure distributed algorithms for fundamental graph problems. We will be focusing on two main objectives:

  • Initiating and establishing the theoretical exploration of security in distributed graph algorithms. Such a notion has been addressed before mainly in the context of secure multi-party computation (MPC). The heart of our approach is to develop new graph theoretical infrastructures to provide graphical secure channels between nodes in a communication network of an arbitrary topology.

  • Developing efficient distributed algorithms against various adversarial settings, such as, node crashes and Byzantine attacks.

The main novelty in addressing these objectives is in our approach, which is based on taking a graph theoretic perspective where common notions of resilience requirements will be translated into suitably tailored combinatorial graph structures. We believe that the proposed perspective will deepen the theoretical foundations for resilient distributed computation, strengthen the connections with the areas of fault tolerant network design and information theoretic security, and provide a refreshing perspective on extensively-studied graph theoretical concepts.

Supported by grants from the Israel Science Foundation (no. 2084/18) and the European Research Council (ERC-2020-StG, grant agreement No. 949083).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The term natural refers to distributed algorithms whose local computation (performed at each node) is polynomial in the input size.

  2. 2.

    Currently under submission.

  3. 3.

    We note that it will be then important to extend this result to the setting of edge corruptions.

References

  1. Abraham, I., Dolev, D.: Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity. In: Proceedings of the 47th Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14–17, 2015, pp. 605–614 (2015)

    Google Scholar 

  2. Augustine, J., King, V., Molla, A.R., Pandurangan, G., Saia, J.: Scalable and secure computation among strangers: message-competitive byzantine protocols. In: 34th International Symposium on Distributed Computing, DISC 2020, October 12–16, 2020, Virtual Conference, pp. 1–19 (2020)

    Google Scholar 

  3. Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985)

    Article  MathSciNet  Google Scholar 

  4. Chuzhoy, J., Parter, M., Tan, Z.: On packing low-diameter spanning trees. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8–11, 2020, Saarbrücken, Germany (Virtual Conference), pp. 1–18 (2020)

    Google Scholar 

  5. Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 169–178. ACM (2011)

    Google Scholar 

  6. Dolev, D.: The byzantine generals strike again. J. Algorithms 3(1), 14–30 (1982)

    Article  MathSciNet  Google Scholar 

  7. Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC (1994)

    Google Scholar 

  8. Garay, J.A., Yoram, M.: Fully polynomial byzantine agreement for n \(>\) 3t processors in t + 1 rounds. SIAM J. Comput. 27(1), 247–290 (1998)

    Article  MathSciNet  Google Scholar 

  9. Hitron, Y., Parter, M.: Round-efficient distributed byzantine computation. CoRR, abs/2004.06436 (2020)

    Google Scholar 

  10. Hitron, Y., Parter, M.: Broadcast algorithms against adaptive adversarial edges. In: Under Submission (2021)

    Google Scholar 

  11. Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445–462. Springer, Heidelberg (2006). https://doi.org/10.1007/11818175_27

    Chapter  Google Scholar 

  12. Kushilevitz, E.: Privacy and communication complexity. In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October–1 November 1989, pp. 416–421. IEEE Computer Society (1989)

    Google Scholar 

  13. Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling ino (congestion+ dilation) steps. Combinatorica 14(2), 167–186 (1994)

    Article  MathSciNet  Google Scholar 

  14. Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)

    Article  Google Scholar 

  15. Parter, M.: Fault-tolerant logical network structures. Bull. EATCS 118 (2016)

    Google Scholar 

  16. Parter, M.: Small cuts and connectivity certificates: a fault tolerant approach. In: 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)

    Google Scholar 

  17. Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Netw. Int. J. 28(3), 143–156 (1996)

    MathSciNet  MATH  Google Scholar 

  18. Peleg, D.: Distributed Computing: A Locality-sensitive Approach. SIAM, Philadelphia (2000)

    Book  Google Scholar 

  19. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228–234 (1980)

    Article  MathSciNet  Google Scholar 

  20. Parter, M., Yogev, E.: Distributed algorithms made secure: a graph theoretic approach. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6–9, 2019, pp. 1693–1710 (2019)

    Google Scholar 

  21. Parter, M., Yogev, E.: Low congestion cycle covers and their applications. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6–9, 2019, pp. 1673–1692 (2019)

    Google Scholar 

  22. Parter, M., Yogev, E.: Optimal short cycle decomposition in almost linear time (2019). http://www.weizmann.ac.il/math/parter/sites/math.parter/files/uploads/main-icalp-cycles-full.pdf

  23. Parter, M., Yogev, E.: Optimal short cycle decomposition in almost linear time. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9–12, 2019, Patras, Greece, pp. 1–14 (2019)

    Google Scholar 

  24. Parter, M., Yogev, E.: Secure distributed computing made (nearly) optimal. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, pp. 107–116 (2019)

    Google Scholar 

  25. Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 1989. LNCS, vol. 349, pp. 304–313. Springer, Heidelberg (1989). https://doi.org/10.1007/BFb0028994

    Chapter  Google Scholar 

  26. Santoro, N., Widmayer, P.: Distributed function evaluation in the presence of transmission faults. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 358–367. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52921-7_85

    Chapter  Google Scholar 

  27. Shanbhogue, V., Yung, M.: Distributed computing in asynchronous networks with byzantine edges. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 352–360. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61332-3_169

    Chapter  Google Scholar 

  28. Toueg, S., Perry, K.J., Srikanth, T.K.: Fast distributed agreement. SIAM J. Comput. 16(3), 445–457 (1987)

    Article  MathSciNet  Google Scholar 

  29. Weimann, O., Yuster, R.: Replacement paths and distance sensitivity oracles via fast matrix multiplication. ACM Trans. Algorithms (TALG) 9(2), 1–13 (2013)

    Article  MathSciNet  Google Scholar 

  30. Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160–164. IEEE (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Weizmann Institute, Rehovot, Israel

    Merav Parter

Authors
  1. Merav Parter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Merav Parter .

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Tomáš Bureš

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Free University of Bozen-Bolzano, Bolzano, Italy

    Johann Gamper

  4. University of Genoa, Genoa, Italy

    Giovanna Guerrini

  5. University of Wroclaw, Wroclaw, Poland

    Tomasz Jurdziński

  6. Free University of Bozen-Bolzano, Bolzano, Italy

    Claus Pahl

  7. University Paris Dauphine, Paris, France

    Florian Sikora

  8. University of Liverpool, Liverpool, UK

    Prudence W.H. Wong

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parter, M. (2021). Invited Talk: Resilient Distributed Algorithms. In: Bureš, T., et al. SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science(), vol 12607. Springer, Cham. https://doi.org/10.1007/978-3-030-67731-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67731-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67730-5

  • Online ISBN: 978-3-030-67731-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation