计算机应用与软件2016，Vol.33Issue(3)：327-333,7.DOI:10.3969/j.issn.1000-386x.2016.03.077
可证安全的无证书签密方案
A PROVABLY SECURE CERTIFICATELESS SIGNCRYPTION SCHEME
邹昌芝1
作者信息
- 1. 荆楚理工学院教育技术中心 湖北 荆门 448000
- 折叠
摘要
Abstract
The study on several newly proposed certificateless signcryption schemes without pairing operation found that there are the correctness flaws or security flaws.Therefore,we proposed a new certificateless signcryption scheme without pairing.The new signcryption scheme changes the linear structure of two keys in current scheme,and is able to resist the public key replacement attack launched by the type I adversary;and it bonds the identities of signcryption sender and receptor with the message to be signed the encryption by adopting two hash functions to prevent internal attacks.The unforgeability and confidentiality of the new signcryption scheme could be deduced to a polynomial time adversary to resolve the discrete logarithm problem and decision Diffie Hellman problem,which were provably secure,in the random oracle model.Comparing with existing schemes,the new scheme not only ensures the security,its computational overhead and implementation costs are also lower,and is suitable for protecting data confidentiality,integrity and authentication in computing,storing and communication resources-constrained scenarios,like the wireless sensor networks.关键词
无证书密码学/签密/双线性对/随机预言模型Key words
Certificateless cryptography/Signcryption/Bilinear pairing/Random oracle model分类
信息技术与安全科学引用本文复制引用
邹昌芝..可证安全的无证书签密方案[J].计算机应用与软件,2016,33(3):327-333,7.
