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

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

Research output: Contribution to journalArticle

23 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)141-145
Number of pages5
JournalComputer Standards and Interfaces
Volume25
Issue number2
DOIs
Publication statusPublished - 2003 May 1

Fingerprint

Hash functions
distribution system
anonymity
Polynomials

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Law

Cite this

@article{ce967042f3e7429287cfee131bcb5649,
title = "A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem",
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.",
author = "Yang, {Chou Chen} and Ting-Yi  Chang and Hwang, {Min Shiang}",
year = "2003",
month = "5",
day = "1",
doi = "10.1016/S0920-5489(03)00002-3",
language = "English",
volume = "25",
pages = "141--145",
journal = "Computer Standards and Interfaces",
issn = "0920-5489",
publisher = "Elsevier",
number = "2",

}

A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem. / Yang, Chou Chen; Chang, Ting-Yi ; Hwang, Min Shiang.

In: Computer Standards and Interfaces, Vol. 25, No. 2, 01.05.2003, p. 141-145.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Yang, Chou Chen

AU - Chang, Ting-Yi 

AU - Hwang, Min Shiang

PY - 2003/5/1

Y1 - 2003/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0037402302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037402302&partnerID=8YFLogxK

U2 - 10.1016/S0920-5489(03)00002-3

DO - 10.1016/S0920-5489(03)00002-3

M3 - Article

VL - 25

SP - 141

EP - 145

JO - Computer Standards and Interfaces

JF - Computer Standards and Interfaces

SN - 0920-5489

IS - 2

ER -