loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

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)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.189.194.225

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Buccafurri, F. ; Sahu, R. and Saraswat, V. (2016). Efficient Proxy Signature Scheme from Pairings. In Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016) - SECRYPT; ISBN 978-989-758-196-0; ISSN 2184-3236, SciTePress, pages 471-476. DOI: 10.5220/0005999804710476

@conference{secrypt16,
author={Francesco Buccafurri and Rajeev Anand Sahu and Vishal Saraswat},
title={Efficient Proxy Signature Scheme from Pairings},
booktitle={Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016) - SECRYPT},
year={2016},
pages={471-476},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005999804710476},
isbn={978-989-758-196-0},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016) - SECRYPT
TI - Efficient Proxy Signature Scheme from Pairings
SN - 978-989-758-196-0
IS - 2184-3236
AU - Buccafurri, F.
AU - Sahu, R.
AU - Saraswat, V.
PY - 2016
SP - 471
EP - 476
DO - 10.5220/0005999804710476
PB - SciTePress