Provably secure identity-based threshold unsigncryption scheme

Authors:
Bo Yang;Yong Yu;Fagen Li;Ying Sun
Affiliations:
College of information, South China Agricultural University, Guangzhou, P.R. China;National Key Lab. of ISN, Xidian University, Xi'an, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;College of information, South China Agricultural University, Guangzhou, P.R. China
Venue:
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Year:
2007

Citing 8
Cited 2

How to construct efficient signcryption schemes on elliptic curves

Information Processing Letters
Digital Signcryption or How to Achieve Cost(Signature & Encryption)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Signcryption and Its Applications in Efficient Public Key Solutions

ISW '97 Proceedings of the First International Workshop on Information Security
A Signcryption Scheme with Signature Directly Verifiable by Public Key

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Two birds one stone: signcryption using RSA

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
ID-Based threshold unsigncryption scheme from pairings

CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Improved identity-based signcryption

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

Fully secure threshold unsigncryption

ProvSec'10 Proceedings of the 4th international conference on Provable security
Signcryption schemes with threshold unsigncryption, and applications

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously. In this paper, we propose an identity based threshold unsigncryption scheme, which is the organic combination of the signcryption scheme, the (t, n) threshold scheme and zero knowledge proof for the equality of two discrete logarithms based on the bilinear map. In this scheme, a signcrypted message can be decrypted only when at least t members join an unsigncryption protocol. We also prove its security in a formal model under recently studied computational assumptions and in the random oracle model. Specifically, we prove its semantic security under the hardness of q-Bilinear Diffie-Hellman Inversion problem and its unforgeability under the q-Strong Diffie-Hellamn assumption.