Journal of Computers, Vol 7, No 7 (2012), 1796-1800, Jul 2012
doi:10.4304/jcp.7.7.1796-1800

A Novel Unidirectional Proxy Re-Signature Scheme and Its Application for MANETs

Xuan Hong, Yu Long

Abstract


Mobile ad-hoc networks (MANETs) have received a lot of attention recently, adapting proxy re-signature to work in such environments is challenging. In this paper, we propose a novel and efficient proxy re-signature scheme, which provides a flexible and secure way for authorizing the new nodes of mobile ad-hoc networks. The proposed scheme is unidirectional, single-use and non-transitive. Compared with the previous schemes, we need only a few public parameters and no pairing operation in signature and re-signature algorithms. We will also give the concrete security analysis of the proposed scheme. Its security is based on the Computational Diffie-Hellman assumption in the random oracle model. Thus, the scheme is suitable for the mobile ad-hoc networks, for it is completely non-interactive and is very simple.



Keywords


Proxy Re-Signature; Unidirectional; Mobile Ad-Hoc Network; CDH Assumption

References


 

[1] M. Blaze, G. Bleumer, and M. Strauss, “Divertible protocols and atomic proxy cryptography,” in EUROCRYPT 1998, vol. LNCS, no. 1403, 1998, pp. 127–144.

[2] M. Blaze and M. Strauss,“Atomic proxy cryptography,” in Technical reports. AT&T Research, 1997.

[3] Y. Dodis and A. Ivan, “Proxy cryptography revisited,” in Network and Distributed System Security Symposium 2003, 2003.

[4] G. Ateniese and S. Hohenberger,“Proxy re-signatures: New definitions, algorithms, and applications,” in ACM CCS 2005, 2005, pp. 310–319.

[5] J. Shao, Z. Chao, L. Wang, and X. Liang, “Proxyresignature schemes without random oracles,” in Indocrypt 2007, vol. LNCS, no. 4859, 2007, pp. 197– 209.

[6] K. Kim, I. Yie, and S. Lim, “Remark on shao et al’s bidirectional proxy re-signature scheme in indocrypt 2007,” International Journal of Network Security, vol. 8, pp. 308– 311, 2009.

[7] B. Libert and D. Vergnaud, “Multi-use unidirectional proxy re-signatures,” in the 15th ACM conference on Computer and communications security 2008, 2008.

[8] S. Chow and R. Phan, “Proxy re-signatures in the standard model,” in ISC 2008, vol. LNCS, no. 5222, 2008, pp. 260– 276.

[9] Y. Deng and G. Song, “Proxy re-signature scheme based on quadratic residues,” Journal of Networks, vol. 6, pp. 1459–1465, 2011.
http://dx.doi.org/10.4304/jnw.6.10.1459-1465

[10] D. Guo, P.Wei, D. Yu, and X. Yang, “A certificateless proxy re-signature scheme,” in Proceedings -2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010, vol. 8, 2010, pp. 157–161.

[11] Y.Deng, “A blind proxy re-signatures scheme based on random oracle,” Advanced Materials Research, vol. 204210, pp. 1062–1065, 2011.
http://dx.doi.org/10.4028/www.scientific.net/AMR.204-210.1062

[12] E.Huang, J. Crowcraft, and I. Wassell, “Rethinking incentives for mobile ad hoc networks,” in Proc. SIGCOMM’04 Workshops 2004, 2004, pp. 191– 196.

[13] J. Schiller,Mobile Communication. Addison-Wesley Professional, 2008.

[14] M. Bellare and P. Pogaway, “Random oracles are practical: A paradigm from designing efficient protocols,” in ACM 1993, 1993, pp. 62–73.

[15] N.Sunitha and B. Amberker, “Proxy re-signature schemes,” in ICISS 2008, vol. LNCS, no. 5352, 2008, pp. 156–157.


Full Text: PDF


Journal of Computers (JCP, ISSN 1796-203X)

Copyright @ 2006-2013 by ACADEMY PUBLISHER – All rights reserved.