基于双线性对,提出了一个基于身份的签名方案,在计算性Diffie-Hellman问题困难的假设下,证明了该方案在随机预言机模型下抗适应性选择消息和身份攻击。基于提出的方案,构造了一个可证安全的可验证加密签名方案,其不可伪造性依赖于提出的基于身份的签名方案,不透明性依赖于基于身份的签名方案和BLS短签名。与已有方案相比,该方案的优势是基于身份,不需要证书,从而简化了密钥管理。
The paper proposed an identity (ID)-based signature scheme from bilinear pairing. The proposed scheme was secure against existential forgery on adaptively chosen message and ID attack in random oracle model under the assumption that the computational Diffie-Hellman problem (CDHP) was hard. Based on the proposed scheme, a verifiably encrypted signature scheme was proposed. Its unforgeability relied on the proposed ID-based signature and its opacity depended on the proposed ID-based signature and BLS short signature. The advantage of the proposed schemes over the existing schemes was that they were ID-based, which need no certificates and had a simple key management.