Abstract: This paper proposes a new identity-based signcryption scheme using bilinear pairings and proves its security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman(BDH) problem. The scheme satisfies confidentiality, unforgeability, nonrepudiation, public verification and forward security. It only costs four pairing operations and two of them can be precomputed. Compared with the efficient schemes up to date, computation cost of the proposed scheme is less.

Key words: signcryption, Identity-Based Encryption(IBE), bilinear pairings

摘要： 利用双线性对提出一种基于身份的签密方案。在BDH问题是困难的假设下，运用随机预言机模型证明该方案的安全性。该方案满足机密性、不可伪造性、不可否认性、公开验证性和前向安全性，仅需4次对运算，其中2次为可预运算。与当前较为高效的几个方案相比，该方案的运算量更低。

关键词: 签密, 基于身份的加密, 双线性对

CLC Number: 

• TP309