A provably secure identity-based strong designated verifier proxy signature scheme from bilinear pairings

Abstract

The proxy signature, a variant of the ordinary digital signature, has been an active research topic in recent years; it has many useful applications, including distributed systems and grid computing. Although many identity-based proxy signature schemes have been proposed in the literature, only a few proposals for identity-based strong designated verifier proxy signature (ID-SDVPS) schemes are available. However, it has been found that most of the ID-SDVPS schemes that have been proposed to date are not efficient in terms of computation and security, and a computationally efficient and secured ID-SDVPS scheme using elliptic curve bilinear pairing has been proposed in this paper. The security of the scheme is mainly based on the hardness assumption of CDH and GBDH problems in the random oracle model, which is existentially unforgeable against different types of adversaries. Furthermore, the security of our scheme is simulated in the AVISPA (Automated Validation of Internet Security Protocols and Applications) software, a widely used automated internet protocol validation tool, and the simulation results confirm strong security against both active and passive attacks. In addition, because of a high processing capability and supporting additional security features, the scheme is suitable for the environments in which less computational cost with strong security is required.