An identity‐based threshold signcryption scheme for multiple receivers is proposed. For thenspecified receivers, the ciphertext can be decrypted and verified when arbitrarytor more receivers work together. The steps of the private keys extraction, the signcryption, the decryption, and the verification are introduced in detail. The chosen‐ciphertext security of the scheme is proved formally. The comparisons to the existing schemes show that the proposed scheme is more secure, more flexible, and the simulative game of the security proof in the scheme is more perfect.
No takes yet. Share an insight, caveat, or question.
Qin et al. (2010) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: