TY - JOUR
T1 - Group-oriented setting's multisigncryption scheme with threshold designcryption
AU - Zhang, Mingwu
AU - Yang, Bo
AU - Takagi, Tsuyoshi
N1 - Funding Information:
The authors gratefully thank the anonymous reviewers for their helpful comments. This work was supported by the National Natural Science Foundation of China ( 60973134 ), the Natural Science Foundation of Guangdong Province ( 10351806001000000 , 10151064201000028 ), the Foundation for Distinguished Young Talents in Higher Education of Guangdong ( wym09066 ), and the supported by Grant-in-Aid for JSPS Fellows (22·00045).
PY - 2011/9/15
Y1 - 2011/9/15
N2 - Signcryption supports the authenticity and confidently in a single logic step and it has more efficient cost than the signature-then-encryption approach. Currently signcryption schemes only support a peer to peer secure message transfer between single users, and thus it cannot be adapted to the group users in multiple senders and receivers. In this paper, we propose a group-oriented multisigncryption scheme with threshold designcryption in multi-users setting, which combines the threshold secret sharing technology, zero knowledge proof for the bilinear map equality of two discrete logarithms, multi-signature and identity-based signcryption schemes. The ciphertext in the proposed scheme is computed by all the m members in sender group, and it can be decrypted only by t-out-of-n members in receiver group. We prove the security of the proposed scheme in several models including semantic security, unforgeability, public ciphertext authenticity and verifiability.
AB - Signcryption supports the authenticity and confidently in a single logic step and it has more efficient cost than the signature-then-encryption approach. Currently signcryption schemes only support a peer to peer secure message transfer between single users, and thus it cannot be adapted to the group users in multiple senders and receivers. In this paper, we propose a group-oriented multisigncryption scheme with threshold designcryption in multi-users setting, which combines the threshold secret sharing technology, zero knowledge proof for the bilinear map equality of two discrete logarithms, multi-signature and identity-based signcryption schemes. The ciphertext in the proposed scheme is computed by all the m members in sender group, and it can be decrypted only by t-out-of-n members in receiver group. We prove the security of the proposed scheme in several models including semantic security, unforgeability, public ciphertext authenticity and verifiability.
UR - http://www.scopus.com/inward/record.url?scp=79959743463&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959743463&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2011.05.005
DO - 10.1016/j.ins.2011.05.005
M3 - Article
AN - SCOPUS:79959743463
SN - 0020-0255
VL - 181
SP - 4041
EP - 4050
JO - Information sciences
JF - Information sciences
IS - 18
ER -