Device-to-device (D2D) communication presents a new paradigm in mobile networking to facilitate data exchange between physically proximate devices. The development of D2D is driven by mobile operators to harvest short range communications for improving network performance and supporting proximity-based services. In this paper, we investigate two fundamental and interrelated aspects of D2D communication, security and privacy, which are essential for the adoption and deployment of D2D. We present an extensive review of the state-of-the-art solutions for enhancing security and privacy in D2D communication. By summarizing the challenges, requirements, and features of different proposals, we identify lessons to be learned from existing studies and derive a set of “best practices.” The primary goal of our work is to equip researchers and developers with a better understanding of the underlying problems and the potential solutions for D2D security and privacy. To inspire follow-up research, we identify open problems and highlight future directions with regard to system and communication design. To the best of our knowledge, this is the first comprehensive review to address the fundamental security and privacy issues in D2D communication.

Security and Privacy in Device-to-Device (D2D) Communication: A Review

A lightweight multi-layer authentication protocol for wireless body area networks

Smart cities are increasingly relying on information and communication technologies to cope with today's challenges, including increasing population, heterogeneous economic growth, and environmental legislation hardening. The use of Unmanned Aerial Vehicles (UAVs) generates a growing interest in coping with such challenges, along with new business opportunities. As a result, it is expected to see the number of drone-based applications to rise at a very fast pace, entailing new cybersecurity risks to emerge. In this paper, we propose to tackle the problem of secure communication among untrusting parties with a certificateless-group authenticated key agreement (CL-GAKA) scheme. The intent is to enable confidentiality, message integrity, and authenticity in UAV-to-UAV communication. Provisioning untrusted UAV networks with trusted communication will provide ground for further research and applications, such as collaborative cybersecurity deterrence, network extension using trusted relay nodes, collaborative mission exercise in time-critical applications, or anonymous communication for user privacy. Moreover, in order to fill the gap of technology awareness, we provide an implementation and demonstrate that the generation of a session key between two users can be performed in approximately 600ms on a Raspberry Pi 3 Model B+ system-on-chip (1.4GHz Cortex-A53). Finally, the protocol is formally evaluated with the Scyther tool.

A Certificateless Group Authenticated Key Agreement Protocol for Secure Communication in Untrusted UAV Networks

Aydos et al.and Mangipudi et al.proposed an ECC-based wireless authentication and key agreement protocol respectively. Unfortunately,there are some security flaw such as man-in-middle attack,denial-of-service attack,impersonation attack etc.to thse protocols.For this reason,a security enhanced protocol is proposed in this paper,which can not only achieve the essential security achievements of a good MAKAP,but overcome weaknesses referred above.At the end of the protocol,identifies both of parters are testified and they agree a session key for subsequent communication between user and server.

An elliptic curve cryptography based on authentication and key agreement protocol for wireless communication

How to improve both security and energy efficiency is one of the most prominent issues in wireless sensor networks WSNs. In this paper, we present a trusted and energy efficient approach for cluster-based WSNs. The approach offers i trusted hardware module design; ii energy-efficient clustering algorithm; and iii network operation. In the cluster-based WSNs, every cluster head is equipped with a designed trusted hardware module TM to improve security. Then, for improving the energy efficiency of the network, a trusted hardware based energy efficient clustering TEEC algorithm is proposed to select appropriate cluster heads. In the network operation, we use TEEC algorithm to perform clustering and apply TMs to achieve security functions. The analysis shows that our approach does well in resisting the attacks such as data confidentiality attack, data integrity attack, and compromise node attack. In addition, experimental results show that the TEEC algorithm makes more balanced clusters with the variance value of loads around 50% and prolongs the life cycle of the network at least 10% compared to traditional methods.

https://journals.sagepub.com/doi/pdf/10.1155/2016/3815834

A Trusted and Energy Efficient Approach for Cluster-Based Wireless Sensor Networks

group communication is an active area of research and its popularity is fuelled by the growing importance of group oriented internet applications such as voice & video conferences, pay per view, etc. Several groupware applications like video conferences, distributed computations, etc requires secure transmission while communicating over the Internet. For secure communication, the integrity of the messages, member authentication, and confidentiality are must be provided among group members. To provide message integrity all group members must be agreed up on a common group key to encrypt and decrypt the messages. This paper proposes an efficient and contributory group key agreement protocol and also support dynamic operations like join, leave, merge, etc. by using ECC based Diffie Hellman key exchange. This protocol employs ternary tree like structure instead of binary tree in the process of group key generation. The performance of the proposed scheme is compared with that of several others existing schemes in literature and it is found that the proposed one is performs well in terms of communication and computation cost. In addition, the formal security validation is done using AVISPA tool that demonstrated that the proposed protocol is safe against passive and active attacks.

/pdf/ternary-tree-based-group-key-agreement-protocol-over-4spln1926y.pdf

Ternary Tree based Group Key Agreement Protocol Over Elliptic Curve for Dynamic Group

Group key agreement protocol is the primary requirement of several groupware applications like secure conferences; pay-per view, etc. which requires secure and authentic conversations among a group of participants via public networks. Protocols based on the certificateless public key cryptography (CL-PKC) are in demand because it overcomes the complex certificate management of traditional public key cryptography, as well as the key escrow problem of identity-based cryptography. Several group applications often need users anonymity also, along with their security features. However in current literature only few group key agreement protocols are available which supports user's anonymity. Further almost all GKA protocols based on CL-PKC are employs bilinear pairing in their operations. The expensive computation of pairing motivates the researchers to propose pairing free protocols based on the CL-PKC. The present paper proposes a pairing free certificateless group key agreement protocol that meets the efficiency, authenticity, and strong security with complete anonymity. The formal security validation of proposed protocol has been done by using automated validation of internet security protocols and applications tool which shows that it is unforgeable against the various attacks. The proposed protocol has the comparable performance than other existing protocols in terms of computation and communication overheads.

A Pairing Free Anonymous Certificateless Group Key Agreement Protocol for Dynamic Group

Secure group communication is an active area of research and its popularity is fuelled by the growing importance of group-oriented applications such as teleconferences, collaborative workspace, pay per-view etc. A number of group key agreement protocols have been proposed for these objectives. However most of the protocols have not considers the anonymity of the participants. Although in some applications the privacy of member's identity becomes more crucial and urgent especially for mobile users of a wireless network due to the open nature of radio media. The protocols having complex computations like large modular exponentiations, pairing computations, etc. are not well suited in wireless environments. Hence this paper proposes an anonymous ID-based group key agreement protocol without bilinear pairings. The proposed protocol also have anonymous join and leave procedures to facilitates the dynamic group operations. Security and performance analysis of proposed protocol shows that it provides strong security protection under different security attributes, and needs comparatively less computation and communication overheads than the other existing protocols. In addition the formal security verification of proposed protocol has been done by using AVISPA tool which shows that it is unforgeable against active and passive attacks.

Anonymous ID-based Group Key Agreement Protocol without Pairing

Secure group communication is an important research issue in the field of cryptography and network security, because group applications like online chatting programs, video conferencing, distributed database, online games etc. are expanding rapidly. Group key agreement protocols allow that all the members agree on the same group key, for secure group communication, and the basic security criteria must be hold. The design of secure group communication can be very critical for achieving security goals. Many group key agreement protocols such as Tree-based Group Diffie-Hellman (TGDH) Kim et al. (ACM Trans Inf Syst Secur (TISSEC) 7(1):60–96, (2004)) [1], Group Diffie-Hellman (GDH) Steiner et al. (IEEE Trans Parallel Distrib Syst 11(8):769–780, (2000)) [2], Skinny Tree (STR) Wong et al. (IEEE/ACM Trans Netw 8(1):16–30, (2000)) [3] etc., have been established for secure group communication, but they have suffered from unnecessary delays as well as their communication cost increased due to increased exponentiation. An alternative approach to group key agreement is the queue based group key agreement protocol that reduces unnecessary delays, considers member diversity with filtering out low performance members in group key generation processes. We propose a novel queue based group key agreement protocol that uses the concepts of elliptic curve cryptography. The proposed protocol gives better results than the other existing related protocols and it also reduces computational overheads.

Design of Queue-Based Group Key Agreement Protocol Using Elliptic Curve Cryptography

Pay-TV application is one of the challenging home appliances where a TV program is delivered to a group of customers. The broadcaster of the Pay-TV system needs to assure that only legitimate subscribers/customers can watch the subscribed TV program. To deliver a TV program confidentially to its subscribers, the broadcaster may encrypt the program by a group key shared by all subscribers. Thus the Pay-TV system often requires a group key establishment protocol to establish a symmetric key among all the subscribers subscribing for a particular program. The group key agreement protocol for Pay-TV system presented so far are requires bilinear pairing computations which creates a big overhead for subscribers specially in wireless environment. A protocol is suitable for Pay-TV system only when most of the computational load are shifted to the broadcaster than the subscribers because the subscribers may have less computational resources as compared to the broadcaster. The present paper proposes an ID-based group key agreement protocol suitable for the Pay-TV system without using bilinear pairing. The proposed protocol also have efficient join and leave procedures to allow dynamic subscriptions with forward and backward secrecy. Moreover, the security of the proposed protocol is justified with respect to the necessary security attributes. Finally the performance of proposed protocol has been compared with some other existing protocols which shows that the proposed protocol has comparable communication and computation cost with zero pairing computation.

Abhimanyu Kumar

Papers

Ternary Tree based Group Key Agreement Protocol Over Elliptic Curve for Dynamic Group

A Pairing Free Anonymous Certificateless Group Key Agreement Protocol for Dynamic Group

Anonymous ID-based Group Key Agreement Protocol without Pairing

Design of Queue-Based Group Key Agreement Protocol Using Elliptic Curve Cryptography

Design of efficient ID-based group key agreement protocol suited for Pay-TV application