东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

New Multivariate-Based Certificateless Hybrid Signcryption Scheme for Multi-Recipient

ISSN号：1007-1202
期刊名称：Wuhan University Journal of Natural Sciences
时间：2014.10.1
页码：433-440
分类：TP309[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术] TP393.08[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
作者机构：[1]Department of Electronic Technology, Engineering Universityof Chinese Armed Police Force, Xi'an 710086, Shaanxi, China, [2]College of Information Science and Technology, NorthwestUniversity, Xi'an 710127, Shaanxi, China
相关基金：Foundation item： Supported by the National Natural Science Foundation of China （61103231, 61103230, 61272492, 61202492）, the Project Funded by China Postdoctoral Science Foundation and Natural Science Basic Research Plan in Shaanxi Province of China （2014JQ8358, 2014JQ8307, 2014JM8300）
相关项目：面向安全群体通信的新型签密及应用研究

作者： Han Yiliang|Yue Zelun|Fang Dingyi|Yang Xiaoyuan|

关键词：签密方案, 混合加密, 证书, 收件人, 量子计算机, 基础, 随机预言模型, 公钥密码, multivariate public key cryptography, certificateless hybrid signcryption, multi-receiver, post-quantum cryptography

中文摘要：

与量计算机的开发，承受量攻击有的 multivariate 公钥密码学成为了研究焦点之一。从分离对数和双线性的 paring 的存在 signcryption 计划正在面对严肃的威胁。基于 multivariate 公钥密码学，一个新无证书的多接收装置混血儿 signcryption 计划被建议了。这个建议减少了零文章并且能由采用再使用的随意和混合加密处理任意的长度消息，以及保留安全。在随机的神谕模型，计划机密能承受 IND-CCA2 对手，它的 unforgeability 能在 multivariate 的坚硬下面承受 UF-CMA 对手二次(MQ ) 多项式(IP ) 的问题和同晶型假设。它比其它有更少的计算开销和更高的传播效率。它与存在类似的计划相比减少了 33% 零数据。

英文摘要：

With the development of quantum computer, multivariate public key cryptography withstanding quantum attack has became one of the research focus. The existed signcryption schemes from discrete logarithm and bilinear paring are facing the serious threats. Based on multivariate public key cryptography, a new certificateless multi-receiver hybrid signcryption scheme has been proposed. The proposal reduced the cipher text and could handle arbitrary length messages by employing randomness reusing and hybrid encryption, as well as keeping security. In the random oracle model, the scheme＇s confidentiality could withstand the IND-CCA2 adversary and its unforgeability could withstand the UF-CMA adversary under the hardness of multivariat quadratic （MQ） problem and isomorphism of polynomials （IP） assumption. It has less computation overhead and higher transmission efficiency than others. It reduced 33% cipher data compared with the existed similar scheme.

同期刊论文项目