Resisting Compromise in Remote Swarm Attestation: Dependable and Secure Key Computation for Prover and Verifier

The Internet of Things (IoT) includes a multitude of heterogeneous devices that operate on a large-scale, dynamic, and self-organizing swarm, making it an interesting target for attackers. Swarm attestation is a means to satisfy the security requirement in which a prover entity attempts to demonstrate its honesty to a verifier in the swarm. To date, various models have been proposed for swarm attestation in which public key infrastructure is used for authentication between different devices. However, public key infrastructure has some disadvantages, such as the problem of expired certification, which adds additional overhead to the system. Most previous works, have not explored key agreement and authentication subjects for swarm attestation. Therefore, in this paper, we propose a high speed and low-cost method for authentication and key agreement in swarm attestation. We also conduct a security evaluation of the proposed security protocol, including the ProVerif as a verification tool and also investigate the resistance of the proposed scheme against various well-known attacks. Informal security analysis shows that the proposed protocol is secure. The computational costs are estimated and evaluated through implementation on the NanoPi Fire3 platform. Our results indicate that the cost of our protocol is reasonable and it is suitable for swarm attestation.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-09-02
DOI
https://doi.org/10.1109/tdsc.2025.3605538
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resisting Compromise in Remote Swarm Attestation: Dependable and Secure Key Computation for Prover and Verifier

Morteza Nikooghadam, Samane Sekhavati
IEEE Transactions on Dependable and Secure Computing
Computability, Logic, AI Algorithms
article

Resisting Compromise in Remote Swarm Attestation: Dependable and Secure Key Computation for Prover and Verifier

Morteza Nikooghadam, Samane Sekhavati
article en

Abstract

The Internet of Things (IoT) includes a multitude of heterogeneous devices that operate on a large-scale, dynamic, and self-organizing swarm, making it an interesting target for attackers. Swarm attestation is a means to satisfy the security requirement in which a prover entity attempts to demonstrate its honesty to a verifier in the swarm. To date, various models have been proposed for swarm attestation in which public key infrastructure is used for authentication between different devices. However, public key infrastructure has some disadvantages, such as the problem of expired certification, which adds additional overhead to the system. Most previous works, have not explored key agreement and authentication subjects for swarm attestation. Therefore, in this paper, we propose a high speed and low-cost method for authentication and key agreement in swarm attestation. We also conduct a security evaluation of the proposed security protocol, including the ProVerif as a verification tool and also investigate the resistance of the proposed scheme against various well-known attacks. Informal security analysis shows that the proposed protocol is secure. The computational costs are estimated and evaluated through implementation on the NanoPi Fire3 platform. Our results indicate that the cost of our protocol is reasonable and it is suitable for swarm attestation.

IEEE Transactions on Dependable and Secure ComputingVol. 23(1)
Imam Reza International University (IR)
Openalex Percentile: Top 75%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Resisting Compromise in Remote Swarm Attestation: Dependable and Secure Key Computation for Prover and Verifier — Morteza Nikooghadam, Samane Sekhavati · IEEE Transactions on Dependable and Secure Computing (2025) | TGRS Research Map | TGRS