Group-oriented setting's multisigncryption scheme with threshold designcryption

Mingwu Zhang, Bo Yang, Tsuyoshi Takagi

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)4041-4050
Number of pages10
JournalInformation sciences
Volume181
Issue number18
DOIs
Publication statusPublished - Sep 15 2011

Fingerprint

Cryptography
Signcryption
Semantics
Costs
Receiver
Semantic Security
Multisignature
Bilinear Map
Zero-knowledge Proof
Discrete Logarithm
Secret Sharing
Identity-based
Peer to Peer
Encryption
Equality
Signature
Logic
Authenticity
Secret sharing
Peer to peer

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Group-oriented setting's multisigncryption scheme with threshold designcryption. / Zhang, Mingwu; Yang, Bo; Takagi, Tsuyoshi.

In: Information sciences, Vol. 181, No. 18, 15.09.2011, p. 4041-4050.

Research output: Contribution to journalArticle

Zhang, Mingwu ; Yang, Bo ; Takagi, Tsuyoshi. / Group-oriented setting's multisigncryption scheme with threshold designcryption. In: Information sciences. 2011 ; Vol. 181, No. 18. pp. 4041-4050.
@article{c374b98a4bf7409ba5c3683f6e942950,
title = "Group-oriented setting's multisigncryption scheme with threshold designcryption",
abstract = "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.",
author = "Mingwu Zhang and Bo Yang and Tsuyoshi Takagi",
year = "2011",
month = "9",
day = "15",
doi = "10.1016/j.ins.2011.05.005",
language = "English",
volume = "181",
pages = "4041--4050",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "18",

}

TY - JOUR

T1 - Group-oriented setting's multisigncryption scheme with threshold designcryption

AU - Zhang, Mingwu

AU - Yang, Bo

AU - Takagi, Tsuyoshi

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

VL - 181

SP - 4041

EP - 4050

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 18

ER -