Dilara Akdog˘anSecure Key Agreement Protocol • July 13th, 2015
As in the sample set, we use 300 keys (30 subjects, 10 keys per subject). The entropy values of these keys are given in Figure 6. The more the entropy value approaches to 1, the more random the key is. As can be seen in this figure, 83.67% of the keys have entropy values that are greater than 0.994, and also all of the keys have entropy values that are greater than 0.98, which implies very good randomness. It is important to note that these keys are generated by hashing the common minutiae. It can be normal to have high entropy for the hash results, because the hash functions kind of randomize the input string. Therefore, the entropy values of the concatenation of common minutiae are calculated as well. The concatenation is as follows, x y type. The entropy values of these concatenations are given in Figure 7. Although the
A Secure Key Agreement Protocol for Dynamic GroupSecure Key Agreement Protocol • April 10th, 2017
Abstract— To accomplish secure group communication, it is essential to share a unique cryptographic key among group members. The underlying challenges to group key agreement are scalability, efficiency, and security. In a dynamic group environment, the rekeying process is more frequent; therefore, it is more crucial to design an efficient group key agreement protocol. Moreover, with the emergence of various group-based services, it is becoming common for several multicast groups to coexist in the same network. These multicast groups may have several shared users; a join or leave request by a single user can trigger regeneration of multiple group keys. Under the given circumstances the rekeying process becomes a challenging task. In this work, we propose a novel methodology for group key agreement which exploits the state vectors of group members. The state vector is a set of randomly generated nonce instances which determine the logical link between group members and which empowers the
Secure Key Agreement Protocol for Multi-Drone CommunicationSecure Key Agreement Protocol • February 18th, 2020
Abstract: Unmanned Aerial Vehicles (UAV), or Drone communication, are developing areas of research that can be used in fields of military, hospital or agriculture. Drone communication keeps up associations among drones and a ground station with a satisfactory information rate for sustaining ongoing transmissions. The communication is imparted between one another through RF. This communication is over the air and it should be encrypted. This guarantees an attacker can't comprehend the caught data. The ongoing research areas focus on efficiently encrypting the channel to make it secure and reducing the dependency on GCS for key generation. This paper proposes a key trade protocol for secure drone to drone communication. Normally in a drone communication, the communication between the Ground Control Station(GCS) and the drones are encrypted utilizing the URANUSLink protocol. The drone to drone communication occurs through the ground station which takes a lot of communication time and reso
On the Use of Ordered Biometric Features for Secure Key AgreementSecure Key Agreement Protocol • May 14th, 2018
Abstract—In this work, we propose a novel secure key agree- ment protocol, Secure Key Agreement using Pure Ordered Biometrics (SKA-POB), in which the cryptographic keys are generated using an ordered set of biometrics, without any other helper data. The proposed approach is realized using iris biometrics. Our protocol makes use of hash functions, and we propose a window-based comparison strategy and a window reset method. This way, performance is maximized without sacrificing security. SKA-POB protocol works in round manner, allowing to successfully terminate with key establishment as early as possible so that the complexity is reduced for both client and server sides. Additionally, we employ multi-criteria analyses for our proposed SKA-POB protocol and we provide verification results in terms of performance analysis together with randomness, distinctiveness and attack complexity through security analysis. Results show that highly random and secure keys can be generated with almost no
