Abstract
In 2010, Tseng and Wu proposed a convinced Diffie-Hellman computation scheme. Due to the proposed scheme can provide the convinced commitment property for the Diffie-Hellman problem, it may provide some specific security properties for security mechanisms such as group key agreement protocols with identifying malicious participants and secret sharing schemes with publicly verifiable property. Over the last few years, ID-based cryptography using bilinear pairing systems has received much attention from cryptographic researchers and its security is based on the related bilinear Diffie-Hellman assumptions. In this article, we propose a new convinced commitment scheme for bilinear Diffie-Hellman problem by extending Tseng and Wu's scheme. The proposed scheme can also be embedded in many ID-based group key agreement protocols and secret sharing schemes to provide extra security properties.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011 |
| Pages | 156-161 |
| Number of pages | 6 |
| Publication status | Published - 2011 Sep 1 |
| Event | 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011 - Gyeongju, Korea, Republic of Duration: 2011 Jun 21 → 2011 Jun 23 |
Other
| Other | 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011 |
|---|---|
| Country | Korea, Republic of |
| City | Gyeongju |
| Period | 11-06-21 → 11-06-23 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems