閱讀全文 | |
篇名 |
Efficient Pairing-Free Provably Secure Scalable Revocable Identity-Based Signature Scheme
|
---|---|
並列篇名 | Efficient Pairing-Free Provably Secure Scalable Revocable Identity-Based Signature Scheme |
作者 | Chang-Ji Wang、Hui Huang、Yuan Yuan |
英文摘要 | Revocation functionality is essential for the practical deployment of identity-based cryptosystems because a user’s private key may be corrupted by hacking or the period of a contract expires. Many researchers are focusing on revocable identity-based encryption scheme, while revocable identity-based signature scheme has received limited concentration. Recently, several revocable identity-based signature schemes have been proposed. However, these schemes are not scalable and are vulnerable to signing key exposure attack. In this paper, we first refine the security model of revocable identity-based signature scheme by considering the signing key exposure attack. Then, we propose a pairing - free revocable identity-based signature scheme with signing key exposure resistance. The proposed scheme is more efficient and practical than existing schemes in terms of update cost, sign cost, verification cost and scalability. Finally, we prove the proposed scheme is existentially unforgeable against adaptively chosen message and identity attacks under the standard discrete logarithm assumption in the random oracle model. |
起訖頁 | 503-510 |
關鍵詞 | Revocable identity-based signature、KUNode algorithm、Random oracle model |
刊名 | 網際網路技術學刊 |
期數 | 202003 (21:2期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Prediction Based Compression Algorithm for Univariate and Multivariate Data in Wireless Communication Networks |
該期刊 下一篇
| Arbitrary Style Transfer of Facial Image Based on Feed-forward Network and Its Application in Aesthetic QR Code |