Certificateless short signature scheme from pairing in the standard model

摘要

In a short signature scheme, the length of signature is much smaller than that of the general signature. Short signatures are widely used in low-computation, low-storage, and low-bandwidth communication environments. The proof of security of all certificateless short signature schemes currently known is given in the random oracle model. In this paper, a new certificateless short signature scheme is constructed, and it is proved to be unforgeable in the standard model. Taken into account the computation costs, the scheme performs only one pairing operation, so it is more efficient than previous ones.