MSN 2006: Mobile Ad-hoc and Sensor Networks pp 473-484 | Cite as
Proxy Signature Without Random Oracles
Conference paper
Abstract
In mobile Ad Hoc networks, the existence and availability of trusted authorities is severely limited by intrinsic network features, and problems such as “service availability” have become a crucial issue. A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former when the former is not available. This is an important primitive to ensure the service availability issue. Proxy signatures have found numerous practical applications such as distributed systems, mobile agent applications, etc. However, the security of the known proxy signature schemes is proven in the random oracle which does not imply security in the real world. In this paper, we propose the first proxy signature schemes without random oracle. The unforgeability of our scheme is based on the hardness of the well known Computational Diffie Hellman (CDH) problem.
Keywords
Proxy Signature Without Random Oracles CDH Problem Bilinear PairingsPreview
Unable to display preview. Download preview PDF.
References
- 1.Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 2.Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 3.Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 4.Boldyreva, A., Palacio, A., Warinschi, B.: Secure proxy signature scheme for delegation of signing rights. IACR ePrint Archive (2003), Available at: http://eprint.iacr.org/2003/096/
- 5.Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)Google Scholar
- 6.Cheon, J.H.: Security analysis of the strong diffie-hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1–11. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 7.Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, revisited. In: Proceedings of the 30th Annual Symposium on the Theory of Computing (STOC 1998), pp. 209–218 (1998)Google Scholar
- 8.Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptively chosen message attacks. SIAM Journal on Computing 17(2), 281–308 (1988)MATHCrossRefMathSciNetGoogle Scholar
- 9.Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. IACR ePrint Archive (2006), Available at: http://eprint.iacr.org/2006/165
- 10.Huang, X., Mu, Y., Susilo, W., Zhang, F., Chen, X.: A short proxy signature scheme: Efficient authentication in the ubiquitous world. In: Enokido, T., Yan, L., Xiao, B., Kim, D.Y., Dai, Y.-S., Yang, L.T. (eds.) EUC-WS 2005. LNCS, vol. 3823, pp. 480–489. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 11.Lee, J.-Y., Cheon, J.H., Kim, S.: An analysis of proxy signatures: Is a secure channel necessary? In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 68–79. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- 12.Lee, B., Kim, H., Kim, K.: Strong proxy signature and its applications. In: Proc. of SCIS 2001, pp. 603–608 (2001)Google Scholar
- 13.Lee, B., Kim, H.-S., Kim, K.: Secure mobile agent using strong non-designated proxy signature. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 474–486. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 14.Kim, S., Park, S., Won, D.: Proxy signatures, revisited. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 223–232. Springer, Heidelberg (1997)CrossRefGoogle Scholar
- 15.Mambo, M., Usuda, K., Okamoto, E.: Proxy signature: delegation of the power to sign messages. IEICE Trans. Fundamentals E79-A(9), 1338–1353 (1996)Google Scholar
- 16.Okamoto, T., Inomata, A., Okamoto, E.: A proposal of short proxy signature using pairing. In: International Conference on Information Technology (ITCC 2005), pp. 631–635. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 17.Okamoto, T., Tada, M., Okamoto, E.: Extended proxy signatures for smart cards. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 247–258. Springer, Heidelberg (1999)CrossRefGoogle Scholar
- 18.Park, H.-U., Lee, I.-Y.: A digital nominative proxy signature scheme for mobile communication. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 451–455. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 19.Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 20.Wang, G., Bao, F., Zhou, J.: Security analysis of some proxy signatures. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 305–319. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 21.Zhang, R., Furukawa, J., Imai, H.: Short signature and universal designated verifier signature without random oracles. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 483–498. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 22.Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2006