5G网络下可证安全的TPKC-CLPKC异构混合签密方案

TPKC-CLPKC Heterogeneous Hybrid Signcryption Scheme under 5G Network

异构签密能够实现异构密码环境下数据的机密性和不可伪造性。分析现有的异构签密方案,发现它们运算速度较慢,适合加密短消息,而混合签密具有高效封装对称密钥和安全传输数据的优势。文章提出一个5G网络下传统公钥密码系统(TPKC)与无证书公钥密码系统(CLPKC)的异构混合签密方案。该方案不仅能够保证TPKC和CLPKC通信的机密性和认证性,而且能够处理TPKC-CLPKC异构密码环境下任意长度的消息,运算速度较快。在随机预言模型下,基于双线性DiffieHellman困难假设、计算Diffie-Hellman困难假设和离散对数困难问题,通过实验证明该方案能实现适应性即选择密文攻击下的密文不可区分性和适应选择消息下的不可伪造性。

Heterogeneous signcryption can be used to guarantee the confidentiality and the unforgeability in the different cryptographies. By analyzing some existing heterogeneous signcryption schemes, it is found that those schemes are slow in operation and more suitable for encrypting short messages. Hybrid signcryption can efficiently encapsulate symmetric keys and securely transmit data. This paper proposes a heterogeneous hybrid signcryption scheme for the traditional public key cr yptosystem(TPKC)-certif icate public key cryptosystem(CLPKC) under 5 G network.The scheme can not only ensure the confidentiality and the unforgeability from TPKC to CLPKC, but also fastly handle the arbitrary length messages. Based on the bilinear Diffie-Hellman difficulty hypothesis, the Diffie-Hellman difficulty hypothesis and the discrete logarithm difficulty problem, it is proved that the scheme satisfies the unforgeability under the adaptive ciphertext attack and the unforgeability under the adaptive selection message.Based on the bilinear of Diffie-Hellman difficulty hypothesis, computational Diffie-Hellman and Discrete logarithm, under the random oracle model.The scheme posseses indistinguishability against adaptive chosen ciphertext attack and existential unforgeability against adaptive chosen messages attack.