现代电子技术2011,Vol.34Issue(15):108-112,5.
基于双线性对的高效短密文签密算法
An Efficient Signcryption Algorithm with Shortened Ciphertext Based on Bilinear Pairing
王晓生 1武光明2
作者信息
- 1. 陕西青年职业学院,陕西西安710068
- 2. 武警工程学院电子技术系,陕西西安 710086
- 折叠
摘要
Abstract
Signcryption is a novel cryptographic system which can prove confidentiality and authenticity simultaneously. While the known signcryption schemes with low communication performance is the bottleneck which influenced the broad application of sigcryption. An efficient signcryption algorithm with shortened ciphertext based on BLS signature is proposed in this paper. It is provable security in random oracle model under GDH assumption. With present secure parameters, the data rate of proposed algorithm is 76%. It has the highest communication performance in all of known schemes. The algorithm is suitable for resource constrained applications.关键词
签密/双线性对/可证明安全/BLS签名Key words
signcryption/ bilinear paring/ provable secure/ BLS signature分类
信息技术与安全科学引用本文复制引用
王晓生,武光明..基于双线性对的高效短密文签密算法[J].现代电子技术,2011,34(15):108-112,5.