Provably Secure and Pairing-Based Strong Designated Verifier Signature Scheme with Message Recovery

Abstract

In this paper, an efficient and secure strong designated verifier signature with message recovery scheme is presented using elliptic curve and bilinear pairing. In our scheme, the signer implants a message on the signature and sends it without message to the verifier, who then extracts the original message and validates the message-signature pair. However, an outsider is unable to verify the message-signature pair since the verifier’s private key is strictly required for verification. Our scheme has been designed to achieve confidentiality, integrity, authentication and non-repudiation of message transmitted through hostile networks. Our scheme is secure against adaptive chosen message attack in the random oracle model under the intractability assumption of Co-Bilinear Diffie–Hellman problem. Besides, our scheme is computation and communication efficient than other schemes, and hence, it may be useful in many small message applications and also for the resource-constrained environments.