Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shijia Hong

dblp:402/2279 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-6414-3678ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Vehicular, aerial and satellite networks · 50% Internet of things and sensor networks · 50%
Network and information security
1 paper
Cryptographic protocols and secure computation · 77% Blockchain and cryptocurrency security · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks › aerial networks
flying ad-hoc networks
1.012026
An Efficient iTreeKEM-Based Group Key Agreement Protocol for Flying Ad-Hoc Networks · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › group communication
secure group communication
1.012026
An Efficient iTreeKEM-Based Group Key Agreement Protocol for Flying Ad-Hoc Networks · IEEE Trans. Mob. Comput. 2026
Cryptographic protocols and secure computation › key exchange
group key agreement
1.012026
An Efficient iTreeKEM-Based Group Key Agreement Protocol for Flying Ad-Hoc Networks · IEEE Trans. Mob. Comput. 2026
Blockchain and cryptocurrency security
smart contract
0.312026
An Efficient iTreeKEM-Based Group Key Agreement Protocol for Flying Ad-Hoc Networks · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

tree-based key encapsulation · 2.0smart contract leader election · 2.0
YearPublicationVenuePosition
2026 An Efficient iTreeKEM-Based Group Key Agreement Protocol for Flying Ad-Hoc Networks
abstract
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.
Tianqi Zhou, Shijia Hong, Jian Shen 0001, Md. Zakirul Alam Bhuiyan, Pandi Vijayakumar, Debiao He
IEEE Trans. Mob. Comput.2