Abstract
One strategy for distributing conference keys is for a chairman to one-way distribute the conference key to all participants. However, the chairman does not know whether the participants are present to receive the conference key or not. Thus, the number of attendants for the conference cannot be controlled, a drawback when a conference requires that the number of members exceed a certain threshold value. This paper will propose a new scheme such that only when t or more members out of m participants of the conference are on-line, can they derive the conference key. The scheme is also extended to a generalized case.
| Original language | English |
|---|---|
| Pages (from-to) | 181-191 |
| Number of pages | 11 |
| Journal | Applied Mathematics and Computation |
| Volume | 112 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 2000 Jun 15 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
Cite this
}
(t,m) Threshold and generalized ID-based conference key distribution system. / Wang, Chih Hung; Hwang, Tzone-Lih.
In: Applied Mathematics and Computation, Vol. 112, No. 2-3, 15.06.2000, p. 181-191.Research output: Contribution to journal › Article
TY - JOUR
T1 - (t,m) Threshold and generalized ID-based conference key distribution system
AU - Wang, Chih Hung
AU - Hwang, Tzone-Lih
PY - 2000/6/15
Y1 - 2000/6/15
N2 - One strategy for distributing conference keys is for a chairman to one-way distribute the conference key to all participants. However, the chairman does not know whether the participants are present to receive the conference key or not. Thus, the number of attendants for the conference cannot be controlled, a drawback when a conference requires that the number of members exceed a certain threshold value. This paper will propose a new scheme such that only when t or more members out of m participants of the conference are on-line, can they derive the conference key. The scheme is also extended to a generalized case.
AB - One strategy for distributing conference keys is for a chairman to one-way distribute the conference key to all participants. However, the chairman does not know whether the participants are present to receive the conference key or not. Thus, the number of attendants for the conference cannot be controlled, a drawback when a conference requires that the number of members exceed a certain threshold value. This paper will propose a new scheme such that only when t or more members out of m participants of the conference are on-line, can they derive the conference key. The scheme is also extended to a generalized case.
UR - http://www.scopus.com/inward/record.url?scp=0040953204&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0040953204&partnerID=8YFLogxK
U2 - 10.1016/S0096-3003(99)00041-7
DO - 10.1016/S0096-3003(99)00041-7
M3 - Article
AN - SCOPUS:0040953204
VL - 112
SP - 181
EP - 191
JO - Applied Mathematics and Computation
JF - Applied Mathematics and Computation
SN - 0096-3003
IS - 2-3
ER -