Pub. online:1 Jan 2007Type:Research ArticleOpen Access
Volume 18, Issue 2 (2007), pp. 239–252
We propose an Identity Based Strong Designated Verifier Signature (IBSDVS) scheme using bilinear pairings. Designated Verifier Signature finds application in e-voting, auctions and call for tenders. We prove that the scheme is secure against existential forgery under adaptively chosen message and identity attack in random oracle model. We also show that the problem of delegatability does not exist in our scheme.
Pub. online:1 Jan 2006Type:Research ArticleOpen Access
Volume 17, Issue 2 (2006), pp. 177–186
This paper presents identity based serial and parallel multisignature schemes using bilinear pairings. Our serial multisignature scheme requires a forced verification at every level to avoid the overlooking of the predecessors' signatures. However, in parallel multisignature scheme the verification of individual signatures is performed by a designated clerk. We show that our schemes are secure against existential forgery under adaptive chosen message attack in the random oracle model.
Pub. online:1 Jan 2004Type:Research ArticleOpen Access
Volume 15, Issue 4 (2004), pp. 455–464
A proxy signature allows a designated person, called a proxy signer, to sign the message on behalf of the original signer. Proxy signatures are very useful tools when one needs to delegate his/her signing capability to other party. A number of proxy signature schemes have been proposed and succeeded for proxy delegations, but the schemes are in defective in proxy revocations. In this paper, we propose two proxy signature schemes based on RSA cryptosystems. The proposed first scheme does not consider proxy revocation mechanism; however, it will help us to compare our protocol with the existing RSA‐based schemes. The proposed second scheme provides an effective proxy revocation mechanism. The proposed schemes do not require any secure channel to proxy key delivery and support the necessary security requirements of proxy signature.