基于双线性对的高效短密文签密算法  

An Efficient Signcryption Algorithm with Shortened Ciphertext Based on Bilinear Pairing

作　　者：王晓生[1] 武光明[2] 

机构地区：[1]陕西青年职业学院,陕西西安710068 [2]武警工程学院电子技术系,陕西西安710086

出　　处：《现代电子技术》2011年第15期108-112,共5页Modern Electronics Technique

摘　　要：签密是一种能够同时保证机密性和认证性的新颖体制,但已有方案的通信效率较低,成为影响签密广泛应用的主要问题之一。基于BLS签名,构造了一个具有短密文属性的高效签密方案。该方案在Random Oracle模型和GDH假设之下是可证明安全的。明文数据率在当前的安全参数下可达76%,是已知方案中密文长度最短的方案,特别适用于带宽受限场合的安全通信。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签名 

分 类 号：TN918-34[电子电信—通信与信息系统]