Anonymous conference key distribution systems based on the discrete logarithm problem

Yuh-Min Tseng, J. K. Jan

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

In 1997, Wu proposed a conference key distribution system (CKDS) with user anonymity using algebraic operations. User anonymity is, in which the identities of participants in a conference are anonymous to each other, except for the chairperson. In this article, two CKDSs with user anonymity are proposed. One is a modified one of the Wu's scheme that uses simple interpolating properties of polynomials to replace the algebraic approach. Both the Wu's original scheme and our modified one require a one-way hash function to hide the identities of participants and to protect each participant's common key shared with the chairperson. Both schemes also use the one-way hash function to provide the authentication for the chairperson. Moreover, we propose another scheme which does not use a one-way hash function, but also achieve the same purposes. Compared to the Wu's scheme, both our schemes require less computing time. The security of the proposed CKDSs is based on the difficulty of computing the discrete logarithm problem as well as the one-way hash cryptographic function assumption. Both schemes are secure against impersonation and conspiracy attacks.

Original languageEnglish
Pages (from-to)749-754
Number of pages6
JournalComputer Communications
Volume22
Issue number8
DOIs
Publication statusPublished - 1999 May 25

Fingerprint

Hash functions
Authentication
Polynomials

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{32334ac2f5fb44a3886b559976903dbf,
title = "Anonymous conference key distribution systems based on the discrete logarithm problem",
abstract = "In 1997, Wu proposed a conference key distribution system (CKDS) with user anonymity using algebraic operations. User anonymity is, in which the identities of participants in a conference are anonymous to each other, except for the chairperson. In this article, two CKDSs with user anonymity are proposed. One is a modified one of the Wu's scheme that uses simple interpolating properties of polynomials to replace the algebraic approach. Both the Wu's original scheme and our modified one require a one-way hash function to hide the identities of participants and to protect each participant's common key shared with the chairperson. Both schemes also use the one-way hash function to provide the authentication for the chairperson. Moreover, we propose another scheme which does not use a one-way hash function, but also achieve the same purposes. Compared to the Wu's scheme, both our schemes require less computing time. The security of the proposed CKDSs is based on the difficulty of computing the discrete logarithm problem as well as the one-way hash cryptographic function assumption. Both schemes are secure against impersonation and conspiracy attacks.",
author = "Yuh-Min Tseng and Jan, {J. K.}",
year = "1999",
month = "5",
day = "25",
doi = "10.1016/S0140-3664(99)00034-1",
language = "English",
volume = "22",
pages = "749--754",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "8",

}

Anonymous conference key distribution systems based on the discrete logarithm problem. / Tseng, Yuh-Min; Jan, J. K.

In: Computer Communications, Vol. 22, No. 8, 25.05.1999, p. 749-754.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Anonymous conference key distribution systems based on the discrete logarithm problem

AU - Tseng, Yuh-Min

AU - Jan, J. K.

PY - 1999/5/25

Y1 - 1999/5/25

N2 - In 1997, Wu proposed a conference key distribution system (CKDS) with user anonymity using algebraic operations. User anonymity is, in which the identities of participants in a conference are anonymous to each other, except for the chairperson. In this article, two CKDSs with user anonymity are proposed. One is a modified one of the Wu's scheme that uses simple interpolating properties of polynomials to replace the algebraic approach. Both the Wu's original scheme and our modified one require a one-way hash function to hide the identities of participants and to protect each participant's common key shared with the chairperson. Both schemes also use the one-way hash function to provide the authentication for the chairperson. Moreover, we propose another scheme which does not use a one-way hash function, but also achieve the same purposes. Compared to the Wu's scheme, both our schemes require less computing time. The security of the proposed CKDSs is based on the difficulty of computing the discrete logarithm problem as well as the one-way hash cryptographic function assumption. Both schemes are secure against impersonation and conspiracy attacks.

AB - In 1997, Wu proposed a conference key distribution system (CKDS) with user anonymity using algebraic operations. User anonymity is, in which the identities of participants in a conference are anonymous to each other, except for the chairperson. In this article, two CKDSs with user anonymity are proposed. One is a modified one of the Wu's scheme that uses simple interpolating properties of polynomials to replace the algebraic approach. Both the Wu's original scheme and our modified one require a one-way hash function to hide the identities of participants and to protect each participant's common key shared with the chairperson. Both schemes also use the one-way hash function to provide the authentication for the chairperson. Moreover, we propose another scheme which does not use a one-way hash function, but also achieve the same purposes. Compared to the Wu's scheme, both our schemes require less computing time. The security of the proposed CKDSs is based on the difficulty of computing the discrete logarithm problem as well as the one-way hash cryptographic function assumption. Both schemes are secure against impersonation and conspiracy attacks.

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

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

U2 - 10.1016/S0140-3664(99)00034-1

DO - 10.1016/S0140-3664(99)00034-1

M3 - Article

VL - 22

SP - 749

EP - 754

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 8

ER -