Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Efficient ID-Based Multi-proxy Signature Scheme from Bilinear Pairing Based on k-plus Problem
verfasst von : Shivendu Mishra, Rajeev Anand Sahu, Sahadeo Padhye, Rama Shankar Yadav
Erschienen in: Integrated Computing Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Proxy signatures are efficient alternatives to delegate the signing rights. In a proxy signature scheme, the original signer can delegate its signing rights to any other party, to make signature on its behalf. In a multi-proxy signature scheme, the original signer delegates its signing rights to a group of persons called proxy groups. With the exploit of bilinear pairing over elliptic curves, several ID-based multi-proxy signature schemes have been developed till now [5,9,17]. In this paper, we have proposed an ID-based multi-proxy signature, based on ‘
k-plus
problem’. The proposed scheme is secure under the INV-CDHP assumption. Moreover, our scheme is computationally more efficient than the schemes [5,9] and assure all the security requirements of a proxy signature, given in [11].