Signcryption scheme with threshold shared unsigncryption preventing malicious receivers

A new signcryption scheme with (t, n) shared unsigncryption based on the discrete logarithm is proposed, which is the integration of the signcryption scheme of Jung et al. (2001) and the Shamir (1979) secret sharing scheme. In this scheme, any t of n receivers can unsigncrypt the message and any t-1 or fewer receivers can not unsigncrypt the message. As compared to Hsu and Wu's authenticated encryption scheme with (t, n) shared verification, the proposed scheme has the following advantages: it is more efficient for signcryption; it can prevent malicious receivers from cheating others.

[1]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  Tzong-Chen Wu,et al.  Authenticated encryption scheme with (t, n) shared verification , 1998 .

[4]  Huo Yan Chen,et al.  Improvement of authenticated encryption scheme with (t, n) shared verification , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[5]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[6]  Hugo Krawczyk,et al.  Keying Hash Functions for Message Authentication , 1996, CRYPTO.

[7]  Yuliang Zheng,et al.  The SPEED Cipher , 1997, Financial Cryptography.