Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings
Manik Lal Das, Ashutosh Saxena, Deepak B Phatak

TL;DR
This paper introduces a bilinear pairing-based proxy signature scheme that enables efficient revocation and avoids secure channels during key issuance, addressing key escrow issues and enhancing security.
Contribution
It proposes a novel proxy signature scheme with a binding-blinding technique for key issuance that prevents key escrow and eliminates the need for secure channels.
Findings
Provides effective proxy revocation
Resists common security threats
Overcomes key escrow problem
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Internet Traffic Analysis and Secure E-voting
