计算机科学
组密钥
计算机网络
协议(科学)
分布式计算
架空(工程)
钥匙(锁)
密钥协议
小组交流
密码协议
密码学
两阶段提交协议
可靠性(半导体)
带宽(计算)
电信网络
对偶(语法数字)
Internet协议控制协议
通信协议
公钥密码术
单点故障
路由协议
反向地址解析协议
作者
Tianqi Zhou,Seongmin Hong,Jian Shen,Md Zakirul Alam Bhuiyan,Pandi Vijayakumar,Debiao He
标识
DOI:10.1109/tmc.2025.3607316
摘要
As Flying Ad-hoc Network (FANET) evolves toward larger scales and higher levels of autonomy, the importance of secure and efficient group communication continues to grow. However, resource-constrained unmanned aerial vehicles (UAVs) face dual challenges: limited computational power struggles to meet the high demands of complex cryptographic algorithms, while bandwidth constraints exacerbate communication overhead caused by multi-round interaction mechanisms. Moreover, existing solutions find it hard to support dynamic group environments and are prone to single point of failure (SPoF) in centralized architectures, which significantly compromises system reliability and scalability. To address these issues, this paper proposes a novel key agreement protocol for FANET. The protocol employs an improved tree-based key encapsulation mechanism (iTreeKEM) to support rapid key updates in highly dynamic environments. It reduces the computational cost for each group member by 90.08% even when the group size reaches 128. To further enhance system robustness, the protocol introduces a smart contract-based distributed leader election mechanism, effectively eliminating SPoF. The security of the proposed protocol is guaranteed by the CDH problem under the generalized selective decryption (GSD) model. Finally, we implement the protocol in NS-3 simulations, and the results demonstrate its effective applicability to FANET.
科研通智能强力驱动
Strongly Powered by AbleSci AI