A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem

  • Authors:
  • Chou-Chen Yang;Ting-Yi Chang;Min-Shiang Hwang

  • Affiliations:
  • Department of Information and Communication Engineering, Chaoyang University of Technology, 168 Gifeng E. Road, Wufeng, Taichung County 413, Taiwan, ROC;Department of Information and Communication Engineering, Chaoyang University of Technology, 168 Gifeng E. Road, Wufeng, Taichung County 413, Taiwan, ROC;Graduate Institute of Networking and Communication Engineering, Chaoyang University of Technology and Department of Information Management, Chaoyang University of Technology, Taiwan, ROC

  • Venue:
  • Computer Standards & Interfaces
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In 1999, Tseng and Jan [Comput. Commun. 22 (1999) 749] proposed two conference key distribution systems (CKDS) with user anonymity based on the discrete logarithm problem and the interpolating properties of polynomials. Their first CKDS scheme uses a one-way hash function to hide the identities of the participants and to protect each participant's common key that is shared with the chairperson. In this article, we will propose a more efficient CKDS scheme with user anonymity that is based on the elliptic curve discrete logarithm problem and the properties of the line. Our scheme has the advantage of requiring less computing time than the Tseng-Jan CKDS with a one-way hash function.