Authors:
Francesco Buccafurri
1
;
Rajeev Anand Sahu
2
and
Vishal Saraswat
2
Affiliations:
1
University of Reggio Calabria, Italy
;
2
C. R. Rao Advanced Institute of Mathematics Statistics and Computer Science, India
Keyword(s):
Identity-based Cryptography, Digital Signature, Bilinear Pairing, Proxy Signature, Delegation of Signing Rights.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Cryptographic Techniques and Key Management
;
Data Engineering
;
Data Integrity
;
Databases and Data Security
;
Identification, Authentication and Non-Repudiation
;
Information and Systems Security
Abstract:
A proxy signature enables an entity to transfer its signing rights
to another entity, called the proxy signer, without actually sharing
its signing key. Most of the proxy signatures in literature have
been designed using bilinear pairing on the elliptic curve group
with the aim of providing either the property of being
identity-based or efficiency or security.
But almost all of these schemes do not provide all these three
desirable properties together and most of the identity-based proxy
signature (IBPS) schemes are either too inefficient or their security is
based on non-standard assumptions to have practical significance.
In this paper, we propose an efficient and provably secure
identity-based proxy signature scheme from bilinear pairing based on
a standard assumption, the hardness of the computational
Diffie-Hellman problem. The proposed scheme is secure against
existential forgery on adaptive chosen-message and adaptive
chosen-ID attack in the rand
om oracle model. Moreover, we do an
efficiency analysis and show that our scheme is significantly more
efficient in the view of computation and operation time than the
existing similar schemes.
(More)