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

Chou Chen Yang, Ting-Yi  Chang, Min Shiang Hwang

研究成果: Article同行評審

24 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)141-145
頁數5
期刊Computer Standards and Interfaces
25
發行號2
DOIs
出版狀態Published - 2003 五月 1

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Law

指紋 深入研究「A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem」主題。共同形成了獨特的指紋。

引用此