TY - JOUR
T1 - Revocable and strongly unforgeable identity-based signature scheme in the standard model
AU - Liu, Zhenhua
AU - Zhang, Xiangsong
AU - Hu, Yupu
AU - Takagi, Tsuyoshi
PY - 2016/9/25
Y1 - 2016/9/25
N2 - Revocation functionality is crucial for the practicality of the public key cryptosystems, especially for that of identity-based cryptosystems. When some users lose their private keys, the cryptosystems must support an efficient revocation method to revoke such users. On the other hand, strong unforgeability provides stronger security than existential unforgeability and ensures the adversary cannot even produce a new signature for a previously signed message. However, existing revocable identity-based signature schemes can support neither efficient key revocation nor strong unforgeability. In this paper, we propose a strongly unforgeable identity-based signature scheme with efficient revocation. In the proposed scheme, the master key is randomly divided into two parts: one is used to construct the initial secret key, the other is used to generate the key update. Furthermore, they are used to periodically and re-randomly produce signing keys for non-revoked users. Thus, the proposed scheme can efficiently revoke users and resist key exposure attacks. In the standard model, our scheme is proven to be strongly unforgeable under the CDH hardness assumption.
AB - Revocation functionality is crucial for the practicality of the public key cryptosystems, especially for that of identity-based cryptosystems. When some users lose their private keys, the cryptosystems must support an efficient revocation method to revoke such users. On the other hand, strong unforgeability provides stronger security than existential unforgeability and ensures the adversary cannot even produce a new signature for a previously signed message. However, existing revocable identity-based signature schemes can support neither efficient key revocation nor strong unforgeability. In this paper, we propose a strongly unforgeable identity-based signature scheme with efficient revocation. In the proposed scheme, the master key is randomly divided into two parts: one is used to construct the initial secret key, the other is used to generate the key update. Furthermore, they are used to periodically and re-randomly produce signing keys for non-revoked users. Thus, the proposed scheme can efficiently revoke users and resist key exposure attacks. In the standard model, our scheme is proven to be strongly unforgeable under the CDH hardness assumption.
UR - http://www.scopus.com/inward/record.url?scp=84982103473&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84982103473&partnerID=8YFLogxK
U2 - 10.1002/sec.1513
DO - 10.1002/sec.1513
M3 - Article
AN - SCOPUS:84982103473
VL - 9
SP - 2422
EP - 2433
JO - Security and Communication Networks
JF - Security and Communication Networks
SN - 1939-0122
IS - 14
ER -