Efficient Proxy Signature Scheme from Pairings

Francesco Buccafurri, Rajeev Anand Sahu, Vishal Saraswat

2016

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 random 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.

References

  1. Asaar, M. R., Salmasizadeh, M., and Susilo, W. (2014). A short id-based proxy signature scheme. International Journal of Communication Systems.
  2. Boldyreva, A., Palacio, A., and Warinschi, B. (2012). Secure proxy signature schemes for delegation of signing rights. Journal of Cryptology, 25(1):57-115.
  3. Cao, F. and Cao, Z. (2009a). A secure identity-based multiproxy signature scheme. Computers & Electrical Engineering, 35(1):86-95.
  4. Cao, F. and Cao, Z. (2009b).
  5. A secure identity-based Cao, X., Kou, W., and Du, X. (2010). A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges. Information Sciences, 180(15):2895-2903.
  6. Choon, J. C. and Cheon, J. H. (2003). An identity-based signature from gap diffie-hellman groups. In PKC, pages 18-30.
  7. Chow, S. S., Lui, R. W., Hui, L. C., and Yiu, S.-M. (2005). Identity based delegation network. In Progress in Cryptology-Mycrypt 2005 , pages 99-115. Springer.
  8. Gasser, M., Goldstein, A., Kaufman, C., and Lampson, B. (1989). The digital distributed system security architecture. In NCSC, pages 305-319.
  9. He, D., Chen, J., and Hu, J. (2011). An id-based proxy signature schemes without bilinear pairings. Ann. Telecommun., 66(11-12):657-662.
  10. Malkin, T., Obana, S., and Yung, M. (2004). The hierarchy of key evolving signatures and a characterization of proxy signatures. In EuroCrypt, volume 3027 of LNCS, pages 306-322.
  11. Mambo, M., Usuda, K., and Okamoto, E. (1996). Proxy signatures: Delegation of the power to sign messages. IEICE transactions on fundamentals of electronics, communications and computer sciences, 79(9):1338- 1354.
  12. Pointcheval, D. and Stern, J. (2000). Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396.
  13. Sahu, R. A. and Padhye, S. (2015). Identity-based multiproxy multi-signature scheme provably secure in random oracle model. Trans. Emerging Telecommunications Technologies, 26(4):547-558.
  14. Sarde, P. and Banerjee, A. (2015). A secure id-based proxy signature scheme from bilinear pairings. International Journal of Computer Applications, 124(9).
  15. Schuldt, J. C. N., Matsuura, K., and Paterson, K. G. (2008). Proxy signatures secure against proxy key exposure. In PKC, volume 4939 of LNCS, pages 141-161.
  16. Singh, H. and Verma, G. K. (2012). Id-based proxy signature scheme with message recovery. J. Syst. Softw., 85(1):209-214.
  17. Wang, B. (2008). A new identity based proxy signature scheme. IACR Cryptology ePrint Archive, 2008:323.
  18. Wu, W., Mu, Y., Susilo, W., Seberry, J., and Huang, X. (2007). Identity-based proxy signature from pairings. In Autonomic and Trusted Computing, pages 22-31.
  19. Xu, J., Zhang, Z., and Feng, D. (2005). Id-based proxy signature using bilinear pairings. In Parallel and Distributed Processing and Applications-ISPA 2005 Workshops, pages 359-367.
Download


Paper Citation


in Harvard Style

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 - Volume 4: SECRYPT, (ICETE 2016) ISBN 978-989-758-196-0, pages 471-476. DOI: 10.5220/0005999804710476


in Bibtex Style

@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 - Volume 4: SECRYPT, (ICETE 2016)},
year={2016},
pages={471-476},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005999804710476},
isbn={978-989-758-196-0},
}


in EndNote Style

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