A novel k-times short digital signature scheme using pairing
Jianhong Zhang, Jianjun Xie · 2008
Digital signature schemes allow a signer to transform any arbitrary message into a signed message, such that anyone can verify the validity of the signed message by the signer’s public key. But, sometimes, we need to constrain the signer’s signature times. In this letter, we propose a k-times short signature scheme and show that the scheme is secure without random oracle. The scheme makes that the signer can only produce k times signature, and only need one time point multiplication operator in whole signing phase, and the size of the signature is only one element in a finite field. Thus the scheme is very suitable to mobile agent.