BLIND SIGNATURE SCHEMES BASED ON XTR SYSTEM
基于XTR体制的盲签名方案

XTR is a new public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. Compared to RSA and ECC, XTR keys are much smaller than RSA keys of equivalent security, and at most twice as big as ECC keys, but parameter and key selection for XTR are much faster than ECC. Based on XTR system by using traditional blind signature schemes based on discrete logarithm problem and fast method for computing the trace of the elements in the finite field, two blind signature schemes are presented in this paper, the security of which is equivalence to solving XTR-DL problem while the datum is only as 1/3 as that of the previous schemes.