Authenticating tripartite key agreement protocol with pairings

Authors:
Sheng-Li Liu;Fang-Guo Zhang;Ke-Fei Chen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200030, P.R. China;School of Information Science and Technology, Zhongshan University, Guangzhou 510275, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200030, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 7
Cited 3

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

ID-based fair off-line electronic cash system with multiple banks

Journal of Computer Science and Technology
Efficient ID-based multi-decrypter encryption with short ciphertexts

Journal of Computer Science and Technology
Authenticated and communication efficient group key agreement for clustered ad hoc networks

CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an authenticated tripartite key agreement protocol is proposed, which is an ID-based one with pairings. This protocol involves only one round. The authenticity of the protocol is assured by a special signature scheme, so that messages carrying the information of two ephemeral keys can be broadcasted authentically by an entity. Consequently, one instance of the protocol results in eight session keys for three entities. In other word, one instance of the protocol generates a session key, which is eight times longer than those obtained from traditional key agreement protocols. Security attributes of the protocol are presented, and the computational overhead and bandwidth of the broadcast messages are analyzed as well.