A convinced commitment scheme for bilinear Diffie-Hellman problem

Yuh-Min Tseng, Tsu Yang Wu, Tung Tso Tsai

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Proceedings - 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011
頁面156-161
頁數6
出版狀態Published - 2011 九月 1
事件7th International Conference on Networked Computing and Advanced Information Management, NCM 2011 - Gyeongju, Korea, Republic of
持續時間: 2011 六月 212011 六月 23

Other

Other7th International Conference on Networked Computing and Advanced Information Management, NCM 2011
國家Korea, Republic of
城市Gyeongju
期間11-06-2111-06-23

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

指紋 深入研究「A convinced commitment scheme for bilinear Diffie-Hellman problem」主題。共同形成了獨特的指紋。

引用此