Proxy blind signature scheme based on braid group
Xiufeng Zhao · Jisuanji yingyong yanjiu · 2010
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.