说明：  使用威尔配对,本文提出了一种基于身份的环签密方案,给出了具体的算法.该方案能够使消息的 发送者以一种完全匿名的方式发送消息,并且同时实现保密性和认证性两种功能.我们证明了在决策双线性Diffie- Hellman问题难解的假设下,新提出的方案对自适应选择密文攻击是安全的.与传统的先签名后加密的方案 相比,本方案中密文长度有了明显的降低,在低带宽的要求下更加可行.
(Will the use of matching, this paper, a ring of identity-based signcryption program, given a specific algorithm. The program will enable the sender information in a completely anonymous way to send messages, and at the same time to achieve confidentiality and authentication of two functions. We prove that in the decision-making bilinear Diffie-Hellman problem difficult to resolve under the assumption that the new proposal for adaptive chosen ciphertext attack is safe. with the traditional first signed encrypted program compared ciphertext of the program significantly reduced the length, in the low-bandwidth request more feasible.)