Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

A New ID-Based Key Sharing System

Shigeo Tsujii, Jinhui Chao

Published Aug 11, 2007• 14 citations
Publisher
DOI
10.1007/3-540-46766-1_23

Related papers

A new ID-based key distribution system

Shigeo Tsujii

International Cryptology Conference•Jan 1, 1992•1 citation

New scheme of ID-based authenticated multi-party key agreement

Xueyan Liu, Qiang ZHANG, Caifen Wang

Journal of Computer Applications•Jun 17, 2011•1 citation

Certificateless Non-interactive Key Exchange Protocol without Pairings

Yun Wei, Fushan Wei, Chuangui Ma

Non-interactive key exchange (NIKE) allows two parties to establish a shared key without communications. In ID-based non-interactive key exchange (ID-NIKE) protocols, private key generator (PKG) knows user's private key, so it can calculate the shared key between two participants, and most constructions of ID-NIKE need expensive pairing operation. To overcome these disadvantages, a security model of certificateless non-interactive key exchange (CL-NIKE) is proposed in this paper. And a scheme without pairings is also given. The proposed protocol is proved secure in the Random Oracle Model (ROM) based on the gap Diffie-Hellman (GDH) and computational Diffie-Hellman (CDH) problem. In the new protocol, key generation center (KGC) only knows user's partial key and is not able to calculate the shared key. Moreover, the new protocol is more efficient than the existing ID-NIKE schemes because it is pairing-free.

•Jan 1, 2014•2 citations

Identity-Based Non-interactive Key Sharing

Hatsukazu Tanaka

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 25, 1994•3 citations

Two-round ID-based Group Key Agreement Fitted for Pay-TV System

Hyunjue Kim, Nam Junghyun, Kim Seungjoo +1 more

A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.

정보보호학회논문지•Jan 1, 2005•0 citations

Analysis and improvement of ID-based authenticated key agreement protocols

Qiuliang Xu

The security attributes of three provable secure ID-based authenticated key agreement protocols are analyzed,and an enhanced ID-based authenticated key agreement protocol is presented based on the previous work.The new scheme achieves most of the known security attributes,such as known-key secrecy,key-compromise impersonation resilience,unknown key-share resilience,no-key control and message independence,especially the PKG-forward secrecy and known session-specific temporary information secrecy attributes,meanwhile keeping with the nice efficiency.

Computer Engineering and Applications Journal•Jan 1, 2010•0 citations
Non-interactive key exchange (NIKE) allows two parties to establish a shared key without communications. In ID-based non-interactive key exchange (ID-NIKE) protocols, private key generator (PKG) knows user's private key, so it can calculate the shared key between two participants, and most constructions of ID-NIKE need expensive pairing operation. To overcome these disadvantages, a security model of certificateless non-interactive key exchange (CL-NIKE) is proposed in this paper. And a scheme without pairings is also given. The proposed protocol is proved secure in the Random Oracle Model (ROM) based on the gap Diffie-Hellman (GDH) and computational Diffie-Hellman (CDH) problem. In the new protocol, key generation center (KGC) only knows user's partial key and is not able to calculate the shared key. Moreover, the new protocol is more efficient than the existing ID-NIKE schemes because it is pairing-free.
A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.
The security attributes of three provable secure ID-based authenticated key agreement protocols are analyzed,and an enhanced ID-based authenticated key agreement protocol is presented based on the previous work.The new scheme achieves most of the known security attributes,such as known-key secrecy,key-compromise impersonation resilience,unknown key-share resilience,no-key control and message independence,especially the PKG-forward secrecy and known session-specific temporary information secrecy attributes,meanwhile keeping with the nice efficiency.