Provably Secure Pairing-Free Identity-Based Restrictive Partially Blind Signature Scheme

Abstract

The restrictive partially blind signature (RPBS) scheme permits user to explicitly incorporate the common information consulted with signer into the signature, but the choice of message is restricted to certain rules. Many RPBS schemes have been designed by using either under certificate-based public key systems or bilinear pairing. But all these schemes need huge computation and storage of the certificates. In this paper, we propose the first Pairing-Free ID-based RPBS scheme and prove it is secure in the random oracle model. Compared with existing ID-based RPBS schemes, the scheme is simpler, more efficient and offer huge advantages in runtime.