Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16]

Journal of Information Science and Engineering, Vol. 32 No. 6, pp. 1525-1539 (November 2016)

Role-Based Signature and Its Security Proof *

1College of Mathematics and Computer Science
Fujian Normal University
Fuzhou, 350117 P.R. China
2School of Computer and Communication Engineering
University of Science and Technology Beijing
Beijing, 100083 P.R. China
3Fujian Provincial Key Laboratory of Network Security and Cryptology
Fujian Normal University
Fuzhou, 350007 P.R. China

Role-Based Signature (RBS) allows users to sign messages on behalf of his roles under the widely adopted hierarchical Role-Based Access Control (RBAC) model, and the signatures are verified by using the public keys of the roles. In this paper, we firstly make some minor modifications on the role-based signature proposed by Zhu et al. [14]. The modified role-based signature is also based on the partial-order key hierarchy with respect to public key infrastructure, in which each user belongs to a role has a unique private-key to sign messages, and only the public keys of his roles can be used to verify the signatures. Furthermore, we define the formal security model and present a full security proof for the modified RBS using the Forking Lemma. Our proposed scheme is strong existentially unforgeable under the weak attack in the random oracles model. Its security depends on the strong Diffie-Hellman assumption.

Keywords: cryptography, security, role-key hierarchy, role-based signature, proof of security

Full Text () Retrieve PDF document (201611_07.pdf)

Received October 1, 2015; revised November 16, 2015; accepted December 2, 2015.
Communicated by Yung-Yu Chuang.
* This work is supported by the National 973 Program (Grant No. 2013CB329605), the National Natural Science Foundation of China (Grant Nos. 61572132, 61170264, 61472032, and U1405255), and the Natural Science Foundation of Fujian Province (Grant No. 2015J01239).
+ Corresponding author