earticle

논문검색

A Conference Key Distribution Scheme Using Interpolating Polynomials

초록

영어

Conference keys are secret keys used by a group of users commonly and with which they
can encipher (or decipher) messages such that communications are secure. Based on the
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

목차

Abstract
 1. Introduction
 2. Conference Key Distribution
 3. Background of Our Scheme
 4. Security Consideration
 5. The Proposed Scheme
 6. Conclusions
 7. Acknowledgement
 8. References

저자정보

  • Chin-Chen Chang Department of Information Engineering and Computer Science, Feng Chia University, 407 Taichung, Taiwan
  • Chu-Hsing Lin Department of Computer Science and Information Engineering, Tunghai University, 407 Taichung, Taiwan
  • Chien-Yuan Chen Department of Information Engineering, No.1, Sec. 1, Syuecheng Rd., Dashu Township, 840 Kaohsiung County, Taiwan

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.