pith. sign in

arxiv: 0712.3084 · v1 · submitted 2007-12-19 · 💻 cs.CR

Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings

classification 💻 cs.CR
keywords proxyschemesignaturebilineareffectivepairingsprivaterequirements
0
0 comments X
read the original abstract

We present a proxy signature scheme using bilinear pairings that provides effective proxy revocation. The scheme uses a binding-blinding technique to avoid secure channel requirements in the key issuance stage. With this technique, the signer receives a partial private key from a trusted authority and unblinds it to get his private key, in turn, overcomes the key escrow problem which is a constraint in most of the pairing-based proxy signature schemes. The scheme fulfills the necessary security requirements of proxy signature and resists other possible threats.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.