Abstract
Xiaoyu et. al. [1] presented efficient identity based (K, n) threshold signcryption scheme. In this paper, we present variant of [1] with group shared unsigncryption, which is based on discrete logarithm problem in finite field. For unsigncryption to recover the message the cooperation of group members of the receivers group is required. The proposed scheme has additional advantage against malicious verifiers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have