摘要
利用双线性对提出一种基于身份的签密方案。在BDH问题是困难的假设下,运用随机预言机模型证明该方案的安全性。该方案满足机密性、不可伪造性、不可否认性、公开验证性和前向安全性,仅需4次对运算,其中2次为可预运算。与当前较为高效的几个方案相比,该方案的运算量更低。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第8期135-137,共3页
Computer Engineering
关键词
签密
基于身份的加密
双线性对
signcryption
Identity-Based Encryption（IBE）
bilinear pairings
