Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Key Agreement Protocols and Their Security Analysis
Proceedings of the 6th IMA International Conference on Cryptography and Coding
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Identity-based key agreement protocols from pairings
International Journal of Information Security
General Ad Hoc Encryption from Exponent Inversion IBE
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
Information Sciences: an International Journal
Authenticated key exchange protocol with selectable identities
Wireless Communications & Mobile Computing
An efficient dynamic authenticated key exchange protocol with selectable identities
Computers & Mathematics with Applications
Provably secure one-round identity-based authenticated asymmetric group key agreement protocol
Information Sciences: an International Journal
Reducing elliptic curve logarithms to logarithms in a finite field
IEEE Transactions on Information Theory
Identity-based encryption: how to decrypt multiple ciphertexts using a single decryption key
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Provably secure three party encrypted key exchange scheme with explicit authentication
Information Sciences: an International Journal
Hi-index | 0.07 |
The traditional identity-based cryptography requires a user, who holds multiple identities, to hold multiple private keys, where each private key is associated with an identity. Managing multiple private/public keys is a heavy burden to a user due to key management and storage. The recent advancement of identity-based cryptography allow a single private key to map multiple public keys (identities); therefore the private key management is simplified. Unfortunately, the existing schemes capturing this feature do not allow dynamic changes of identities and have a large data size proportional to the number of the associated identities. To overcome these problems, in this paper, we present an efficient and dynamic identity-based key exchange protocol and prove its security under the Bilinear Diffie-Hellman assumption in the random oracle model. Our protocol requires a relatively small bandwidth for a key agreement communication, in comparison with other existing schemes.