A Conference Key Distribution Scheme Using Interpolating Polynomials

Authors:
Chin-Chen Chang;Chu-Hsing Lin;Chien-Yuan Chen
Affiliations:
Feng Chia University, 407 Taichung, Taiwan;Feng Chia University, 407 Taichung, Taiwan;Department of Information Engineering, Dashu Township, 840 Kaohsiung County, Taiwan
Venue:
MUE '07 Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering
Year:
2007

Citing 0
Cited 1

Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conference keys are secret keys used by a group of users commonly with which they can encipher (or decipher) messages such that communications are secure. Based on Diffie and Hellman's PKDS, a conference key distribution scheme is presented in this paper. A sealed lock is used to lock the conference key in such a way that only the private keys of the invited members are matched. Then the sealed lock is thus made public or distributed to all the users, only legitimate users can disclose it and obtain the conference key. In our scheme, the construction of a sealed lock is simple and the revelation of a conference key is efficient as well.