Secure Group Key Agreement on Cyber-Physical System Buses
Preprint
Abstract
Cyber-Physical Systems (CPSs) rely on distributed embedded devices that often must communicate securely over buses. Ensuring message integrity and authenticity on these buses typically requires group-shared keys for Message Authentication Codes (MACs). To avoid insecure fixed pre-shared keys and trust-on-first-use concepts, a Group Key Agreement (GKA) protocol is needed to dynamically agree on a key amongst the devices. Yet existing GKA protocols lack adaptability to constrained CPS buses. This paper targets authenticated, fully distributed GKA suitable for bus topologies under constraints of industrial and cyber-physical systems, including broadcast-only links, half-duplex operation, resource limits, dynamic membership (including unannounced leaves), a long device lifetime, and a strong Dolev-Yao adversary capable of partitioning the bus. We first systematise existing protocols, then derive the requirements necessary for an authenticated and fully distributed GKA on bus systems. Finally, we design, implement, and evaluate a custom GKA protocol based on TreeKEM.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness2023
- A Survey on Secure Group Communication Schemes With Focus on IoT CommunicationIEEE Access, 2022
- OPC UA TSN: a next-generation network for Industry 4.0 and IIoTInternational Journal of Pervasive Computing and Communications, 2021
- A Survey of Group Key Agreement Protocols with Constant RoundsACM Computing Surveys, 2019
- A secure key agreement protocol for dynamic groupCluster Computing, 2017
- Constant Round Dynamic Group Key AgreementLecture Notes in Computer Science, 2005
- Tree-based group key agreementACM Transactions on Information and System Security, 2004
- The Elliptic Curve Digital Signature Algorithm (ECDSA)International Journal of Information Security, 2001
- Key agreement in dynamic peer groupsIEEE Transactions on Parallel and Distributed Systems, 2000
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999