Low-Computation Partially Blind Signature
Xiaohui Li · Beijing Youdian Xueyuan xuebao · 2009
To solve the issues that a signer couldn't predominate the contents when he signs a blind signature and the unpractical efficiency of the existing partially blind signature for high computation,a model of simple partially blind signature with low computation is presented.A detail formal security proof in the random oracle model is given.The new algorithm simplifies the process of the interaction between the signer and requestor,reduces the signature process in computational complexity.Compared with the scheme due to Masayuki Abe and Tatsuaki Okamoto,the new scheme is more efficient.The low-computation property will make the new scheme very attractive for mobile client and smart-card implementation.