Multiaccess Edge Computing Empowered Flying Ad Hoc Networks with Secure Deployment Using Identity-Based Generalized Signcryption

Abstract

<jats:p>A group of small UAVs can synergize to form a flying ad hoc network (FANET). The small UAVs are, typically, prone to security lapses because of limited onboard power, restricted computing ability, insufficient bandwidth, etc. Such limitations hinder the applicability of standard cryptographic techniques. Thus, assuring confidentiality and authentication on part of small UAV remains a far-fetched goal. We aim to address such an issue by proposing an identity-based generalized signcryption scheme. The lightweight security scheme employs multiaccess edge computing (MEC) whereby the primary UAV, as a MEC node, provides offloading to the computationally fragile member UAVs. The scheme is based on the concept of the hyperelliptic curve (HEC), which is characterized by a smaller key size and is, therefore, suitable for small UAVs. The scheme is robust since it offers confidentiality and authentication simultaneously as well as singly. Formal as well as informal security analyses and the validation results, using the Automated Validation for Internet Security Validation and Application (AVISPA) tool, second such notion. Comparative analysis with the existing schemes further authenticates the sturdiness of the proposed scheme. As a case study, the scheme is applied for monitoring crops in an agricultural field. It has been found out that the scheme promises higher security and incurs lower computational and communication costs.</jats:p>

A Provably Secure Authentication and Key Exchange Protocol in Vehicular Ad Hoc Networks

“…Moreover, this environment is also vulnerable to serious security threats. Due to these security threats, many security protocols have been proposed in this environment [44][45][46][47].…”

An Anonymous Certificateless Signcryption Scheme for Internet of Health Things

“…Here, we compare our afresh assembled technique with those of Li et al [16], Cao et al [17], and Liu et al [18], with respect to major operations such bilinear pairing (βρ), exponentiations (ξ ), elliptic curve multiplications (ξρ ), and hyper elliptic curve devisor multiplications (hξ ), which is illustrated in Table 2. Then, we make the comparisons in Table 2, with the help of milli seconds on the basis of results used in [30], which includes the running time for is 14.90 ms; for ξ is 1.25 ms; for hξ is 0.97 ms and for hξ is 0.48 ms [31], [32]. To estimate the performance of the proposed approach, the Multi precision Integer and Rational Arithmetic C Library (MIRACL) is used to test the runtime of the basic cryptographic operations up to 1000 times.…”

An Anonymous Certificateless Signcryption Scheme for Secure and Efficient Deployment of Internet of Vehicles

“…The time required for processing a single Elliptic Curve Point Multiplication (ECPM) is 0.97 ms; bilinear pairing is 14.90 ms; pairing-based point multiplications is 4.31 ms; modular exponentiation is 1.25 ms [33]. The Hyperelliptic Curve Divisor Multiplication (HCDM) is assumed to be 0.48 milliseconds [34][35][36][37][38]. Multi-precision Integer and Rational Arithmetic C Library (MIRACL) [39] is used to measure the computational performance.…”