Another efficient proxy signature scheme in the standard model

Journal of Information Science and Engineering

Volumn 27, Issue 4, 2011, Pages 1249-1264

  Zhang, Jian Hong ^a   Mao, Jian ^b  

^a NORTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b BEIHANG UNIVERSITY   (China)

Author keywords

Mobile agent; Proxy signature; Security proof; Standard model; The k + 1 square roots problem

Indexed keywords

COMPUTATIONAL COSTS; ORIGINAL SIGNERS; PROXY SIGNATURE SCHEME; PROXY SIGNATURES; PROXY SIGNER; PUBLIC KEYS; SECURITY PROOFS; SIGNATURE SCHEME; STANDARD MODEL; THE K + 1-SQUARE ROOTS PROBLEM; THE STANDARD MODEL; WITHOUT RANDOM ORACLE MODEL;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MOBILE AGENTS; MOBILE DEVICES; NETWORK SECURITY; STANDARDS;

AUTHENTICATION;

EID: 80051478463     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. M. Mambo, K. Usuda, and E. Okamot, "Proxy signature: Delegation of the power to sign messages," IEICE Transactions on Fundamentals, Vol. E79-A, 1996, pp. 1338-1353. (Pubitemid 126763603)
2. J. XU, Z. Zhang, and D. Feng, "ID-based proxy signature using bilinear pairings," in Proceedings of Parallel and Distributed Processing and Applications, LNCS 3559, 2005, pp. 359-367.
3. M. Bellare, A. Boldyreva, and A. Palacio, "An un-instantiable random-oracle-model scheme for a hy brid-encryption problem," in Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 3027, 2004, pp. 171-188.
4. R. Canetti, O. Goldreich, and S. Halevi, "The random oracle methodology, revisited," in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp. 209-218.
5. J. Nielsen, "Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case," in Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, LNCS 2442, 2002, pp. 111-126.
6. F. Zhang and K. Kim, "Efficient ID-based blind signature and proxy signature from pairings," in Proceedings of the 8th Australasian Conference on Information Security and Privacy, LNCS 2727, 2003, pp. 312-323.
7. F. Zhang, R. Safavi-Naini, and W. Susilo, "An efficient signature schem e from bilinear pairings and its application," in Proceedings of International Workshop on Practice and Theory in Public Key Cryptography, LNCS 2947, 2004, pp. 277-290.
8. K. Shim, "An identity-based proxy signature scheme from pairings," in Proceedings of International Conference on Information and Communications Security, LNCS 4307, 2006, pp. 60-71.
9. A. Boldyreva, A. Palacio, and B. W arinschi, "Secure proxy signature scheme for delegation of signing rights," IACR ePrint Archive, http://eprint.iacr.org/2003/096.
10. X. Huang, W. Susilo, Y. M u, and W. Wu, "Proxy signature without random oracles," in Proceedings of the 2nd International Conference on Mobile Ad-hoc and Sensor Networks, LNCS 4325, 2006, pp. 473-484.
11. W. Wu, Y. Mu, W. Susilo, J. Seberry, and X. Huang, "Identity-based proxy signature from pairings," in Proceedings of the 4th International Conference on Autonomic and Trusted Computing, LNCS 4610, 2007, pp. 22-31.
12. S. Goldwasser, S. Micali, and R. Rivest, "A digital signature scheme secure against adaptively chosen message attacks," SIAM Journal on Computing, Vol. 17, 1998, pp. 281-308.
13. H. Kim, J. Beak, B. Lee, and K. Kim, "Secret computation with secrets for mobile agent using one-time proxy signature," in Proceedings of the Symposium on Cryptography and Information Security, 2001, pp. 845-850.
14. B. Lee, H. Kim, and K. Kim, "Strong proxy signature and its applications," in Proceedings of the Symposium on Cryptography and Information Security, Vol. 2, 2001, pp. 603-608.
15. I. Foster, C. Kesselman, G. Tsudik, and S. Tuecke, "A security architecture for computational grids," in Proceedings of the 5th ACM Conference on Computer and Communications Security, 1998, pp. 83-92.
16. H. U. Park and L. Y. Lee, "A digital nominative proxy signature scheme for mobile communications," in Proceedings of the 3rd International Conference on Information and Communications Security, LNCS 2229, 2001, pp. 451-455.
17. C. Gamage, J. Leiwo, and Y. Zheng, "An efficient scheme for secure message transmission using proxy-signcryption," in Proceedings of the 22nd Australasian Computer Science, 1999, pp. 420-431.
18. F. Zhang and X. Chen, "Cryptanalysis and im provement of an ID-based ad-hoc anonymous identification scheme at C T-RSA 05," Information Processing Letters, Vol. 109, 2009, pp. 846-849.
19. D. Pointcheval and J. Stern, "Security proofs for signature schemes," in Proceedings of International Conference on the Theory and Application of Cryptographic Techniques Saragossa, LNCS 1070, 1996, pp. 387-398.
20. M. Ballare and P. Rogaway, "Random oracle are practical: A paradiam for designing efficient protocols," in Proceedings of ACM Conference on Computer and Communications Security, 2007, pp. 62-73.
21. J. Zhang, J. Mao, and Y. Yang, "An effi cient proxy signature scheme without random oracle model," in Pre-proceedings II of Information Security and Cryptography, 2008, pp. 535-548.
22. B. Lee, H. Kim, and K. Kim, "Secure mobile agent using strong non-designated proxy signature," in Proceedings of the 6th Australasian Conference on Information Security and Privacy, LNCS 2119, 2001, pp. 474-486.
23. D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," in Proceedings of the 21st Annual International Cryptology Conference, LNCS 2139, 2001, pp. 213-229.
24. F. Zhang, X. Chen, W. Susilo, and Y. Mu, "A new signature scheme without random oracles from bilinear pairings," in Proceedings of the 1st International Conference on Cryptology in Vietnam, LNCS 4341, 2006, pp. 67-80.
25. J. Zhang, C. Liu, and Y. Yang, "An effici ent secure proxy verifiably encrypted signature scheme," Journal Network and Computer Applications, Vol. 33, 2010, pp. 29-34.