在辫群上定义了一种新的数学问题——多一求根问题.基于该问题的难解性构造了一个强盲签名体制,并证明其在随机预言模型下能抵抗适应性选择的消息的多一存在性伪造攻击.与共轭盲签名体制相比,新体制的优势在于计算效率更高、签名长度更短.
A new computational problem over braid groups,one-more root extraction problem,is described,and a new strong blind signature scheme is constructed.The constructed scheme can resist one-more existential forgery against the adaptively chosen message attack under the random oracle model and has advantage over the conjugate blind signature schemes in computational efficiency and shortening signature.