Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys

Michel Ferreira Abdalla, Céline Chevalier, Mark Manulis +1 more

Jonathan I. Katz, Moti M. Yung

M Arifi, Mahmoud Gardeshi

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .

Yue Zheng, Wenye Liu, Chongyan Gu +1 more

Peer to Peer (P2P) or direct connection IoT has become increasingly popular owing to its lower latency and higher privacy compared to database-driven or server-based IoT. However, wireless vulnerabilities raise severe concerns on IoT device-to-device communication. This is further aggravated by the challenge to achieve lightweight direct mutual authentication and secure key exchange between IoT peer nodes in P2P IoT applications. Physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of resource-constrained devices in IoT. Nevertheless, current PUF-enabled authentication protocols, with or without the challenge-response pairs (CRPs) of each of its interlocutors stored in the verifier’s side, are incompatible for P2P IoT scenarios due to the security, storage and computing power limitations of IoT devices. To solve this problem, a new lightweight PUF-based mutual authentication and key-exchange protocol is proposed. It allows two resource-constrained PUF embedded endpoint devices to authenticate each other directly without the need for local storage of CRP or any private secrets, and simultaneously establish the session key for secure data exchange without resorting to public-key algorithm. The proposed protocol is evaluated using the Mao and Boyd logic as well as the automatic security analysis tool ProVerif to corroborate its mutual authenticity, secrecy, and resistance against replay and man-in-the-middle attacks. Using two Avnet Ultra96-V2 boards to emulate the two IoT endpoint devices of a network, a physical prototype system is also constructed to demonstrate and validate the feasibility of the proposed secure P2P connection scheme.

Yuanbo Guo

The consistency is a basic security requirement,but it is much trickier and many times overlooked. By care-fully analyzed to several famous were found provably-secure group key exchange protocols at present,different attacks of the consistency to these protocols were found respectively. These attacks will result in that all the members have different view of peers’ identities and destroying the integrity of the current group. Furthermore,improvements to overcome the security vulnerabilities of these protocols were proposed.

Jonathan I. Katz, Moti M. Yung