DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/9819
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChamola, Vinay-
dc.date.accessioned2023-03-17T09:16:44Z-
dc.date.available2023-03-17T09:16:44Z-
dc.date.issued2022-03-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/9743804-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9819-
dc.description.abstractUnmanned Aerial Vehicles (UAVs) have enabled a broad spectrum of applications serving social, commercial, and military purposes. However, since UAVs use wireless communication technologies, they are highly vulnerable to security threats. Establishing trust with the base station is the most fundamental security aspect in UAV networks to mitigate these threats. However, due to a UAV’s constrained resources, deploying traditional trust establishment schemes in UAV networks becomes challenging. Further, this issue escalates as the number of UAVs increases. To address this issue, we propose an authentication cum attestation protocol for UAV swarms using an optimal communication trajectory, which can establish the required trust in a lightweight manner. Furthermore, our protocol uses Physical Unclonable Functions (PUFs) and thus guarantees physical security as well. We demonstrate that the proposed protocol is feasible, scalable, and secure using a formal Mao Boyd logic approach. Comparative analyses show that the proposed protocol outperforms the state-of-the-art.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectUAVsen_US
dc.subjectPhysical securityen_US
dc.subjectAuthenticationen_US
dc.subjectAttestationen_US
dc.subjectDynamic topologyen_US
dc.titleSHOTS: Scalable Secure Authentication-Attestation Protocol Using Optimal Trajectory in UAV Swarmsen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.