A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Identity-based key agreement protocols from pairings
International Journal of Information Security
EC2C-PAKA: An efficient client-to-client password-authenticated key agreement
Information Sciences: an International Journal
Recursive protocol for group-oriented authentication with key distribution
Journal of Systems and Software
Identity-Based Conference Key Distribution Scheme Using Sealed Lock
ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)
New directions in cryptography
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Information Sciences: an International Journal
One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Information Sciences: an International Journal
Learning latent variable models from distributed and abstracted data
Information Sciences: an International Journal
Efficient remote user authentication and key establishment for multi-server environment
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
Study on two privacy-oriented protocols for information communication systems
Journal of Intelligent Manufacturing
Hi-index | 0.08 |
Recently, Yang et al. proposed an efficient user identification scheme with key distribution, in which it is possible for the user to anonymously log into a system and establish a secret key shared with the system. Mangipudi and Katti later demonstrated a Deniable-of-Service (DoS) attack on the Yang et al. scheme and then proposed an improvement to withstand such an attack. However, this paper demonstrates an identity disclosure attack to show that neither schemes' claimed user anonymity requirement can be achieved. We further propose a novel user identification scheme with key distribution preserving user anonymity for distributed computer networks. The proposed scheme not only withstands the attacks mentioned above, but also achieves the following: (i) user anonymity, (ii) key distribution, (iii) mutual authentication, and (iv) key confirmation. The performance of our scheme is of greater efficiency than that of previously proposed schemes in terms of communication costs and computational complexities.