一个基于CPK的高效签密方案

An Efficient Signcryption Scheme Based on CPK

基于组合公钥原理,该文提出一个新的签密方案CPK-SC,抛弃了传统基于身份签密方案中的配对运算,并通过使用对称密码算法解决了传统基于身份签密方案只能处理定长消息的限制。与已有的基于双线性对的签密方案相比,CPK-SC方案计算量小、生成密文短,适用于计算和通信资源受限环境,具有广泛的应用前景。在判定性Diffie-Hellman(DDH)假设下,论文通过随机预言模型证明了CPK-SC的安全性。

In this paper, a new signcryption scheme called CPK-SC is proposed based on Combined Public Key （CPK） to resolve the authentication and non-repudiation problem. CPK-SC discards the pairings and solves the restriction that the traditional identity-based signcryption schemes can only deal with fixed length messages by introduction symmetric cryptography algorithm. CPK-SC spends fewer computations and produces shorter ciphertext, which can be widely used in the environment of computation and communication resource constrained, such as mobile ad-hoc network. In the random oracle model, the security of CPK-SC is tightly related to the Decision Diffie-Helhnan （DDH） assumption.