Document Open Access Logo

Reliable Communication in Hybrid Authentication and Trust Models

Authors Rowdy Chotkan , Bart Cox , Vincent Rahli , Jérémie Decouchant

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2024.25.pdf
  • Filesize: 1.15 MB
  • 26 pages

Document Identifiers

Author Details

Rowdy Chotkan
  • Delft University of Technology, The Netherlands
Bart Cox
  • Delft University of Technology, The Netherlands
Vincent Rahli
  • University of Birmingham, UK
Jérémie Decouchant
  • Delft University of Technology, The Netherlands

Funding

  • Chotkan, Rowdy: This work was partially supported by NWO/TKI grant BLOCK.2019.004.
  • Rahli, Vincent: This work was partially supported by the Engineering and Physical Sciences Research Council (EPSRC) grant number EP/W034514/1.

Cite As Get BibTex

Rowdy Chotkan, Bart Cox, Vincent Rahli, and Jérémie Decouchant. Reliable Communication in Hybrid Authentication and Trust Models. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 25:1-25:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.OPODIS.2024.25

Abstract

Reliable communication is a fundamental distributed communication abstraction that allows any two nodes within a network to communicate with each other. It is necessary for more powerful communication primitives, such as broadcast and consensus. Using different authentication models, two classical protocols implement reliable communication in unknown and sufficiently connected networks. In the former, network links are authenticated, and processes rely on dissemination paths to authenticate messages. In the latter, processes generate digital signatures that are flooded throughout the network. This work considers the hybrid system model that combines authenticated links and authenticated processes. Additionally, we aim to leverage the possible presence of trusted nodes (e.g., network gateways) and trusted components (e.g., Intel SGX enclaves). We first extend the two classical reliable communication protocols to leverage trusted nodes. Then we propose DualRC, our most generic algorithm that considers the hybrid authentication model by manipulating dissemination paths and digital signatures, and leverages the possible presence of trusted nodes and trusted components. We describe and prove methods that establish whether our algorithms implement reliable communication on a given network.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Computer systems organization → Fault-tolerant network topologies
Keywords
  • Reliable communication
  • Byzantine
  • Authentication models
  • Trust

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Waseem Abbas, Aron Laszka, and Xenofon Koutsoukos. Improving network connectivity and robustness using trusted nodes with application to resilient consensus. IEEE Transactions on Control of Network Systems, 5(4):2036-2048, 2017. URL: https://doi.org/10.1109/TCNS.2017.2782486.
  2. Ittai Abraham, Danny Dolev, Alon Kagan, and Gilad Stern. Authenticated consensus in synchronous systems with mixed faults. Cryptology ePrint Archive, 2022. Google Scholar
  3. ARM. Arm security technology: building a secure system using trustzone technology, 2009. Google Scholar
  4. Michael Backes and Christian Cachin. Reliable broadcast in a computational hybrid model with byzantine faults, crashes, and recoveries. In DSN, 2003. Google Scholar
  5. Amos Beimel and Matthew Franklin. Reliable communication over partially authenticated networks. Theoretical computer science, 220(1):185-210, 1999. URL: https://doi.org/10.1016/S0304-3975(98)00241-2.
  6. Amos Beimel and Lior Malka. Efficient reliable communication over partially authenticated networks. Distributed Computing, 18(1):1, 2005. Google Scholar
  7. Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden, and Aneesh Sharma. Preventing unraveling in social networks: the anchored k-core problem. SIAM Journal on Discrete Mathematics, 29(3):1452-1475, 2015. URL: https://doi.org/10.1137/14097032X.
  8. Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, and Sébastien Tixeuil. Practical byzantine reliable broadcast on partially connected networks. In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pages 506-516. IEEE, 2021. URL: https://doi.org/10.1109/ICDCS51616.2021.00055.
  9. Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Multi-hop byzantine reliable broadcast with honest dealer made practical. Journal of the Brazilian Computer Society, 25(1):9:1-9:23, 2019. URL: https://doi.org/10.1186/S13173-019-0090-X.
  10. Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Boosting the efficiency of byzantine-tolerant reliable communication. In SSS, 2020. Google Scholar
  11. Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Reliable communication in dynamic networks with locally bounded byzantine faults. Journal of Parallel and Distributed Computing, 193:104952, 2024. Google Scholar
  12. Gabriel Bracha. Asynchronous byzantine agreement protocols. Inf. Comput., 75(2):130-143, 1987. URL: https://doi.org/10.1016/0890-5401(87)90054-X.
  13. Christian Cachin, Rachid Guerraoui, and Luís E. T. Rodrigues. Introduction to Reliable and Secure Distributed Programming (2. ed.). Springer, 2011. URL: https://doi.org/10.1007/978-3-642-15260-3.
  14. Miguel Correia, Lau Cheuk Lung, Nuno Neves, and Paulo Veríssimo. Efficient byzantine-resilient reliable multicast on a hybrid failure model. In SRDS, 2002. Google Scholar
  15. Jérémie Decouchant, David Kozhaya, Vincent Rahli, and Jiangshan Yu. Damysus: streamlined BFT consensus leveraging trusted components. In Yérom-David Bromberg, Anne-Marie Kermarrec, and Christos Kozyrakis, editors, European Conference on Computer Systems, pages 1-16. ACM, 2022. URL: https://doi.org/10.1145/3492321.3519568.
  16. Danny Dolev. Unanimity in an unknown and unreliable environment. In FOCS. IEEE, 1981. Google Scholar
  17. Patrick T Eugster, Rachid Guerraoui, A-M Kermarrec, and Laurent Massoulié. Epidemic information dissemination in distributed systems. Computer, 37(5):60-67, 2004. URL: https://doi.org/10.1109/MC.2004.1297243.
  18. Lester Randolph Ford and Delbert Ray Fulkerson. Maximal flow through a network. Canadian journal of Mathematics, 8:399-404, 1956. Google Scholar
  19. Lester Randolph Ford and Delbert Ray Fulkerson. Flows in Networks. Princeton University Press, Princeton, N.J., 1962. Google Scholar
  20. Bernard A. Galler and Michael J. Fischer. An improved equivalence algorithm. Commun. ACM, 7(5):301-303, 1964. URL: https://doi.org/10.1145/364099.364331.
  21. Juan A Garay and Kenneth J Perry. A continuum of failure models for distributed computing. In International Workshop on Distributed Algorithms, pages 153-165. Springer, 1992. URL: https://doi.org/10.1007/3-540-56188-9_11.
  22. Vassos Hadzilacos. Issues of fault tolerance in concurrent computations. Dissertation Abstracts International, 46(7), 1986. Google Scholar
  23. Akira Ichimura and Maiko Shigeno. A new parameter for a broadcast algorithm with locally bounded byzantine faults. Information processing letters, 110(12-13):514-517, 2010. URL: https://core.ac.uk/download/pdf/56648228.pdf, URL: https://doi.org/10.1016/J.IPL.2010.04.003.
  24. Intel SGX. URL: https://software.intel.com/en-us/sgx.
  25. Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. Cheapbft: Resource-efficient byzantine fault tolerance. In EuroSys, 2012. Google Scholar
  26. Anne-Marie Kermarrec and Maarten van Steen. Gossiping in distributed systems. ACM SIGOPS Oper. Syst. Rev., 41(5):2-7, 2007. URL: https://doi.org/10.1145/1317379.1317381.
  27. Chiu-Yuen Koo. Broadcast in radio networks tolerating byzantine adversarial behavior. In PODC, pages 275-282, 2004. URL: https://doi.org/10.1145/1011767.1011807.
  28. Chris Litsas, Aris Pagourtzis, and Dimitris Sakavalas. A graph parameter that matches the resilience of the certified propagation algorithm. In AdHoc-Now, 2013. Google Scholar
  29. Alexandre Maurer and Sébastien Tixeuil. Byzantine broadcast with fixed disjoint paths. Journal of Parallel and Distributed Computing, 74(11):3153-3160, 2014. URL: https://doi.org/10.1016/J.JPDC.2014.07.010.
  30. Alexandre Maurer and Sébastien Tixeuil. Containing byzantine failures with control zones. IEEE TPDS, 26(2):362-370, 2014. URL: https://doi.org/10.1109/TPDS.2014.2308190.
  31. Jämes Ménétrey, Christian Göttel, Anum Khurshid, Marcelo Pasin, Pascal Felber, Valerio Schiavoni, and Shahid Raza. Attestation mechanisms for trusted execution environments demystified. In DisCoTec, 2022. Google Scholar
  32. Karl Menger. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae, 10(1):96-115, 1927. Google Scholar
  33. Fred J. Meyer and Dhiraj K. Pradhan. Consensus with dual failure modes. IEEE TPDS, 2(02):214-222, 1991. URL: https://doi.org/10.1109/71.89066.
  34. Tal Navon and David Peleg. Mixed fault tolerance in server assignment: Combining reinforcement and backup. Theoretical Computer Science, 836:76-93, 2020. URL: https://doi.org/10.1016/J.TCS.2020.06.033.
  35. Andrzej Pelc and David Peleg. Broadcasting with locally bounded byzantine faults. Information Processing Letters, 93(3):109-115, 2005. URL: https://doi.org/10.1016/J.IPL.2004.10.007.
  36. Philip Thambidurai and You-Keun Park. Interactive consistency with multiple failure modes. In SRDS. IEEE, 1988. Google Scholar
  37. Trusted platform module, 2016. URL: https://trustedcomputinggroup.org/resource/tpm-library-specification/.
  38. Lewis Tseng, Nitin Vaidya, and Vartika Bhandari. Broadcast using certified propagation algorithm in presence of byzantine faults. Information Processing Letters, 115(4):512-514, 2015. URL: https://doi.org/10.1016/J.IPL.2014.11.010.
  39. Lewis Tseng, Yingjian Wu, Haochen Pan, Moayad Aloqaily, and Azzedine Boukerche. Reliable broadcast in networks with trusted nodes. In GLOBECOM. IEEE, 2019. Google Scholar
  40. Lewis Tseng, Yingjian Wu, Haochen Pan, Moayad Aloqaily, and Azzedine Boukerche. Reliable broadcast with trusted nodes: Energy reduction, resilience, and speed. Computer Networks, 182:107486, 2020. URL: https://doi.org/10.1016/J.COMNET.2020.107486.
  41. Paulo E Veríssimo. Travelling through wormholes: a new look at distributed systems models. ACM SIGACT News, 37(1):66-81, 2006. URL: https://doi.org/10.1145/1122480.1122497.
  42. Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, and Paulo Veríssimo. Efficient byzantine fault-tolerance. IEEE Trans. Computers, 62(1):16-30, 2013. URL: https://doi.org/10.1109/TC.2011.221.
  43. Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, and Ittai Abraham. Hotstuff: BFT consensus with linearity and responsiveness. In Symposium on Principles of Distributed Computing. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331591.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact