Enver Ozdemir

Yucel Aydin, Gunes K. Kurt, Enver Ozdemir et al.

Drones are begin used for various purposes such as border security, surveillance, cargo delivery, visual shows and it is not possible to overcome such intensive tasks with a single drone. In order to expedite performing such tasks, drone swarms are employed. The number of drones in a swarm can be high depending on the assigned duty. The current solution to authenticate a single drone using a 5G new radio (NR) network requires the execution of two steps. The first step covers the authentication between a drone and the 5G core network, and the second step is the authentication between the drone and the drone control station. It is not feasible to authenticate each drone in a swarm with the current solution without causing a significant latency. Authentication keys between a base station (BS) and a user equipment (UE) must be shared with the new BS while performing handover. The drone swarms are heavily mobile and require several handovers from BS to a new BS. Sharing authentication keys for each drone as explained in 5G NR is not scalable for the drone swarms. Also, the drones can be used as a UE or a radio access node on board unmanned aerial vehicle (UxNB). A UxNB may provide service to a drone swarm in a rural area or emergency. The number of handovers may increase and the process of sharing authentication keys between UxNB to new UxNB may be vulnerable to eavesdropping due to the wireless connectivity. In this work, we present a method where the time and the number of the communication for the authentication of a new drone joining the swarm are less than 5G NR. In addition, group-based handover solutions for the scenarios in which the base stations are terrestrial or mobile are proposed to overcome the scalability and latency issues in the 5G NR.

Sueda Guzey, Gunes Karabulut Kurt, Enver Ozdemir

Group authentication is a method of confirmation that a set of users belong to a group and of distributing a common key among them. Unlike the standard authentication schemes where one central authority authenticates users one by one, group authentication can handle the authentication process at once for all members of the group. The recently presented group authentication algorithms mainly exploit Lagrange's polynomial interpolation along with elliptic curve groups over finite fields. As a fresh approach, this work suggests use of linear spaces for group authentication and key establishment for a group of any size. The approach with linear spaces introduces a reduced computation and communication load to establish a common shared key among the group members. The advantages of using vector spaces make the proposed method applicable to energy and resource constrained devices. In addition to providing lightweight authentication and key agreement, this proposal allows any user in a group to make a non-member to be a member, which is expected to be useful for autonomous systems in the future. The scheme is designed in a way that the sponsors of such members can easily be recognized by anyone in the group. Unlike the other group authentication schemes based on Lagrange's polynomial interpolation, the proposed scheme doesn't provide a tool for adversaries to compromise the whole group secrets by using only a few members' shares as well as it allows to recognize a non-member easily, which prevents service interruption attacks.

Yucel Aydin, Gunes Karabulur Kurt, Enver Ozdemir et al.

In parallel with the advances of aerial networks, the use of drones is quickly included in daily activities. According to the characteristics of the operations to be carried out using the drones, the need for simultaneous use of one or more drones has arisen. The use of a drone swarm is preferred rather than the use of a single drone to complete activities such as secure crowd monitoring systems, cargo delivery. Due to the limited airtime of the drones, new members may be included in the swarm, or there may be a unification of two or more drone swarms when needed. Authentication of the new drone that will take its place in the drone swarm and the rapid mutual-verification of two different swarms of drones are some of the security issues in the swarm structures. In this study, group authentication-based solutions have been put forward to solve the identified security issues. The proposed methods and 5G new radio (NR) authentication methods were compared in terms of time and a significant time difference was obtained. According to the 5G NR standard, it takes 22 ms for a user equipment (UE) to be verified by unified data management (UDM), while in the proposed method, this time varies according to the threshold value of the polynomial used and it is substantially lower than 22 ms for most threshold values.

Yucel Aydin, Gunes Karabulut Kurt, Enver Ozdemir et al.

The widespread use of new technologies such as the Internet of things (IoT) and machine type communication(MTC) forces an increase on the number of user equipments(UEs) and MTC devices that are connecting to mobile networks. Inherently, as the number of UEs inside a base station's (BS) coverage area surges, the quality of service (QoS) tends to decline. The use of drone-mounted BS (UxNB) is a solution in places where UEs are densely populated, such as stadiums. UxNB emerges as a promising technology that can be used for capacity injection purposes in the future due to its fast deployment. However, this emerging technology introduces a new security issue. Mutual authentication, creating a communication channel between terrestrial BS and UxNB, and fast handover operations may cause security issues in the use of UxNB for capacity injection. This new protocol also suggests performing UE handover from terrestrial to UxNB as a group. To the best of the authors' knowledge, there is no authentication solution between BSs according to LTE and 5G standards. The proposed scheme provides a solution for the authentication of UxNB by the terrestrial BS. Additionally, a credential sharing phase for each UE in handover is not required in the proposed method. The absence of a credential sharing step saves resources by reducing the number of communications between BSs. Moreover, many UE handover operations are completed in concise time within the proposed group handover method.

Gunes Karabulut Kurt, Enver Ozdemir, Neslihan Aysen Ozkirisci et al.

In this work, we propose a novel key reconciliation protocol for the quantum key distribution (QKD). Based on Newton's polynomial interpolation, the proposed protocol aims to correct all erroneous bits at the receiver without revealing information to the eavesdropper. We provide the exact frame error rate (FER) expression of the proposed protocol. The inherent nature of the proposed algorithm ensures correcting all erroneous bits if the algorithm succeeds. We present an information-theoretical proof that the revealed information during the key reconciliation process is equal to zero. We also provide a numerical comparison of our algorithm with the asymptotic performance of the error-correcting codes and two exemplary low-density-parity-check (LDPC) codes. The results highlight that our algorithm provides superior performance when compared to the LDPC codes, regardless of the distance between Alice and Bob. Furthermore, the proposed key reconciliation protocol is usable for the longer quantum link distances than the state-of-the-art protocols.

Ufuk Altun, Semiha T. Basaran, Gunes K. Kurt et al.

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against eavesdroppers. With the help of the physical layer security techniques, users can securely decide on a secret key without a trusted party by exploiting the unique properties of the channel. In this context, we develop a physical layer group key generation scheme that is also based on the ideas of the analog function computation studies. We firstly consider the key generation as a function to be computed over the wireless channel and propose two novel methods depending on the users transmission capability (i.e. half-duplex and full-duplex transmissions). Secondly, we exploit the uniqueness of the prime integers in order to enable the simultaneous transmission of the users for key generation. As a result, our approach contributes to the scalability of the existing physical layer key generation algorithms since all users transmit simultaneously rather than using pairwise communications. We prove that our half-duplex network model reduces the required number of communications for group key generation down to a linear scale. Furthermore, the full-duplex network model reduces to a constant scale.