基于双线性对的群签密方案

Group Signcryption Scheme Based on Bilinear Pairings

已有的文献中很少看到有关于群签密的,而被证明安全的群签密则更少了,在已知安全有效的群签名的基础上,构造一个新的基于双线性对的群签密方案。该方案在只改动群签名的签名阶段的基础上,实现群签密。可验证其既不影响群签名的安全性同时又实现加密的功能,而且群签密的长度是一个不随群成员的改变而改变的常数。

There are few papers concerning group signcryption, and even fewer papers about group signcryption that can be proved security. A new group signcryption scheme is proposed based on bilinear pairings, which base on known security effective group signature. A little of the signing section of the group signature is modified to achieve our group signcryption. It can be verified that it not only have no effect on the security of group signature but also realizes encryption, and the length of the group signcryption is a constant which does not change with the change of the group member.