A conference key broadcasting system using sealed locks
Information Systems
Information Processing Letters
Fundamentals of Computer Alori
Fundamentals of Computer Alori
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Several Conference Key Distribution Schemes
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
New directions in cryptography
IEEE Transactions on Information Theory
A conference key distribution system
IEEE Transactions on Information Theory
Conference key distribution schemes for secure digital mobile communications
IEEE Journal on Selected Areas in Communications
Computer Standards & Interfaces
A scalable key-management scheme with minimizing key storage for secure group communications
International Journal of Network Management
Efficient, anonymous, and authenticated conference key setup in cellular wireless networks
Computers and Electrical Engineering
A novel efficient conference scheme for mobile communications
International Journal of Mobile Communications
International Journal of Mobile Communications
New authentication protocol providing user anonymity in open network
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A novel conference key distribution system with re-keying protocol
HSI'05 Proceedings of the 3rd international conference on Human Society@Internet: web and Communication Technologies and Internet-Related Social Issues
| Hi-index | 0.24 |
In 1997, Wu [T.C. Wu, Conference key distribution system with user anonymity based on algebraic approach, IEE Proc. Comput. Digit. Tech. 144(2) (1997) 145-148] 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.