Abstract:

Blind signatures play a central role in applications such as e-cash and e-voting systems, while the notion of partially blind signature is a more applicable variant. This paper presents a model of simple partially blind signature with low computation, from which many simple partially blind signature schemes can be constructed, and gives a detail formal security proof in the random oracle model. Compared with the scheme due to Masayuki Abe and Tatsuaki Okamoto, our scheme is more efficient. The low-computation property makes our scheme very attractive for mobile client and smart-card implementation in many e-commerce applications.

Key words: Partially Blind Signature, Schnorr Signature, Low-Computation, Random Oracle Model