关键词:辫群; 盲签名; 共轭搜索问题; 量子算法; 代理签名
Proxy blind signature scheme based on braid group
LI Feng1, GUO Ai-xia2, ZHAO Xiu-feng3
(1.College of Applied Mathematics, Guangdong University of Technology, Guangzhou 510006,China; 2. College of Information, South China Agricultural University, Guangzhou 510642,China; 3.Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004,China)
Abstract:Three types of traditional hard problem could be resolved by Shor, Boneh and Lipton’s quantum algorithms in po-lynomial time. By the braid group constructed a lot of mathematics difficulties were not an effective solution under the conditions of the quantum computer. It seemed that braid group was a kind of considerable considerable cryptography platform in the future. This paper proposed a new proxy blind signature scheme based on conjugate search problem and the p-th root finding problem, and the exchangeable of the group operation between the elements in the left subgroup and the right subgroup of a braid group. Through program analysis shows that the new scheme is effective and feasible.......