An Efficient Signcryption Schemes based on Bilinear Maps
Unforgeabilty is a primitive property of a secure digital signature. As an extensions of digital signature, signcryption plays an important role in the sensitive transmission. Since it can fulfill both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature thenencryption approach. In the work, we proposed an efficient signcrypiton scheme based on bilinear maps. Our proposed scheme satisfies the semantic security, unforgeability, and public authenticity. We also give the formal security proof in the random oracle model, and the security of the scheme is related to the CDH problem.
signcryption unforgeability random oracle model security proof
Jianhong Zhang Xiuna Su
College of sciences, North China University of Technology, Beijing, China
国际会议
南京
英文
918-922
2010-11-01（万方平台首次上网日期，不代表论文的发表时间）