A new efficient authenticated multiple-key exchange protocol from bilinear pairings

  • Authors:
  • Mohammad Sabzinejad Farash;Mahmoud Ahmadian Attari;Reza Ebrahimi Atani;Mohamadreza Jami

  • Affiliations:
  • Department of Mathematics and Computer Sciences, Tarbiat Moallem University, P.O. Box 15815-3587, Tehran, Iran;Faculty of Electrical and Computer Engineering, K.N. Toosi University, P.O. Box 16315-1355, Tehran, Iran;Department of Computer Engineering, University of Guilan, P.O. Box 3756, Rasht, Iran;Faculty of Computer Science, Payame Noor University, P.O. Box 19395-3697, Tehran, Iran

  • Venue:
  • Computers and Electrical Engineering
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The main goal of this paper is to analyze the security of a multiple-key agreement protocol and to show that this protocol is vulnerable to forgery attack. In order to address the security weakness, a new efficient multiple-key agreement protocol is proposed. The proposed protocol is based on bilinear pairings and utilizes a novel signature scheme without one-way hash functions. In contrast to related protocols which are based on bilinear pairings, in the proposed protocol, these pairings are not utilized for the included signature scheme, but they are only used for session keys. As a result, the computational complexity of the proposed protocol is decreased by 50% compared to that of the existing protocols. Another contribution of the proposed protocol is an increase of the number of the session keys up to (n^2(n+1)^2/4), for n=2 random numbers, regarding the bilinear property of the pairings. Finally, the simulation results from AVISPA tools confirm the security analysis of the proposed protocol.