Identity-based conference key distribution systems
This paper proposes identity-based key distribution systems for generating a common secret conference key for two or more users. Users are connected in a ring, a complete graph, or a star network. Messages among users are authenticated using each user’s identification information. The security of the proposed systems is based on the difficulty of both factoring large numbers and computing discrete logarithms over large finite fields.
- SHAMIR, A.: ‘Identity-based cryptosystems and signature schemes’, Proceedings of Crypto-84, Santa Barbara, August 1984, pp47–53Google Scholar
- FIAT, A. and SHAMIR, A.: ‘How to prove yourself: Practical solutions to identification and signature problems’, Proceedings of Crypto-86, Santa Barbara, August 1986, pp18-1–18-7Google Scholar
- LENSTRA, Jr. H. W.: ‘Factoring integers with elliptic curves’, preprint, May 1986Google Scholar
- YACOBI, Y.: ‘Attack on the Koyama-Ohta identity-based key distribution STAR system’, private communication, July 13, 1987.Google Scholar