A conference key broadcasting system using sealed locks
Information Systems
Information Processing Letters
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Identity-based Conference Key Distribution Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Fast Software Implementation for Arithmetic Operations in GF(2n)
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Fast Key Exchange with Elliptic Curve Systems
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Comments on two anonymous conference key distribution systems
Computer Standards & Interfaces
Conference key distribution schemes for secure digital mobile communications
IEEE Journal on Selected Areas in Communications
Comments on multiparty key exchange scheme
ACM SIGOPS Operating Systems Review
Efficient, anonymous, and authenticated conference key setup in cellular wireless networks
Computers and Electrical Engineering
Comments on two anonymous conference key distribution systems
Computer Standards & Interfaces
Journal of Network and Computer Applications
International Journal of Mobile Communications
Low-Complexity authentication scheme based on cellular automata in wireless network
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Hi-index | 0.00 |
In 1999, Tseng and Jan [Comput. Commun. 22 (1999) 749] proposed two conference key distribution systems (CKDS) with user anonymity based on the discrete logarithm problem and the interpolating properties of polynomials. Their first CKDS scheme uses a one-way hash function to hide the identities of the participants and to protect each participant's common key that is shared with the chairperson. In this article, we will propose a more efficient CKDS scheme with user anonymity that is based on the elliptic curve discrete logarithm problem and the properties of the line. Our scheme has the advantage of requiring less computing time than the Tseng-Jan CKDS with a one-way hash function.