首页 | 本学科首页   官方微博 | 高级检索  
     

可证安全的传统公钥密码-无证书公钥密码异构聚合签密方案
引用本文:张玉磊,王欢,马彦丽,刘文静,王彩芬.可证安全的传统公钥密码-无证书公钥密码异构聚合签密方案[J].电子与信息学报,2018,40(5):1079-1086.
作者姓名:张玉磊  王欢  马彦丽  刘文静  王彩芬
基金项目:国家自然科学基金(61163038, 61262056),甘肃省高等学校科研项目(2017A-003, 2015B-220)
摘    要:异构签密可以保证异构密码系统之间数据的机密性和不可伪造性。分析现有的异构签密方案,发现它们只针对单个消息,无法实现批验证。聚合签密能够把不同用户对多个消息产生的签密密文同时发送给接收者,而且可以提供批量验证,降低验证开销。该文提出一个传统公钥密码-无证书公钥密码异构聚合签密方案,该方案不仅能够保证传统公钥密码(TPKI)和无证书公钥密码(CLPKC)系统间通信的机密性和认证性,而且聚合验证时不需要双线性对。在随机预言模型下,基于间隙双线性Diffie-Hellman困难问题、计算Diffie-Hellman困难问题和离散对数问题,证明该方案满足自适应性选择密文攻击下的不可区分性和自适应选择消息下的不可伪造性。

关 键 词:异构签密    聚合签密    间隙双线性Diffie-Hellman问题    计算Diffie-Hellman问题    离散对数问题
收稿时间:2017-07-19

Provable and Secure Traditional Public Key Infrastructure-certificateless Public Key Cryptography Heterogeneous Aggregate Signcryption Scheme
ZHANG Yulei,WANG Huan,MA Yanli,LIU Wenjing,WANG Caifen.Provable and Secure Traditional Public Key Infrastructure-certificateless Public Key Cryptography Heterogeneous Aggregate Signcryption Scheme[J].Journal of Electronics & Information Technology,2018,40(5):1079-1086.
Authors:ZHANG Yulei  WANG Huan  MA Yanli  LIU Wenjing  WANG Caifen
Abstract: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 they only deal with a single message and can not achieve batch verification. Aggregation signcryption can not only take n distinct signcryption on n messages signed by n distinct users, but also provide a batch verification and reduce the cost of verification. In this paper, a Traditional Public Key Infrastructure (TPKI)-CertificateLess Public Key Cryptography (CLPKC) heterogeneous aggregation signcryption scheme is proposed, which can ensure the confidentiality and authentication between the TPKI and CLPKC. The scheme does not require bilinear pairings when it is aggregated. It is proved that the scheme has indistinguishability against adaptive chosen ciphertext attack and existential unforgeability against adaptive chosen messages attack under gap bilinear Diffie-Hellman and computational Diffie-Hellman problem and Discrete logarithm.
Keywords:
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号