通信学报2017，Vol.38Issue(2)：16-24,9.DOI:10.11959/j.issn.1000-436x.2017024
基于多项式同构的代理重签名方案
Proxy re-signature scheme based on isomorphisms of polynomial
摘要
Abstract
Most of the existing proxy re-signature schemes were based on the hardness of big integer factoring, discrete logarithm, elliptic curve. However, none of them can resist the attack by a quantum computer. Motivated by these con-cerns, a new proxy re-signature scheme was proposed. By employing secret affine transformations and homogeneous polynomials, the proposed scheme could implement the signature transformation with high-efficiency, and meanwhile it was secure against the attack by a quantum computer. The results of analysis showed that the proposed scheme was cor-rect and consistent, and had the unforgeability in the random oracle model. Compared with the existing schemes, the pro-posed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems, but also has the properties of multi-use, transparent and private proxy.关键词
代理重签名/多变量公钥密码体制/多项式同构/仿射变换Key words
proxy re-signature/multivariate public key cryptosystem/isomorphisms of polynomial/affine transformation分类
信息技术与安全科学引用本文复制引用
李慧贤,邵璐,庞辽军..基于多项式同构的代理重签名方案[J].通信学报,2017,38(2):16-24,9.基金项目
国家自然科学基金资助项目(No.61103178, No.61473214) （No.61103178, No.61473214）
陕西省自然科学基础研究计划基金资助项目(No.2015JM6294, No.2016JM6002) （No.2015JM6294, No.2016JM6002）
中央高校基本科研业务费专项基金资助项目(No.3102015JSJ0003)The National Natural Science Foundation of China (No.61103178, No.61473214), The Natural Science Basic Research Plan in Shaanxi Province of China (No.2015JM6294, No.2016JM6002),The Fundamental Research Funds for the Central Universities (No.3102015JSJ0003) （No.3102015JSJ0003）
