Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 307637, 6 pages
http://dx.doi.org/10.1155/2014/307637
Research Article

A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model

Institute of Information Engineering and Huanghe Science and Technology College, Zhengzhou 450063, China

Received 25 April 2014; Revised 15 August 2014; Accepted 17 August 2014; Published 25 September 2014

Academic Editor: Yan-Wu Wang

Copyright © 2014 Lili Zhang and Yanqin Ma. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Chaum, “Blind signat ures for untraceable payments,” in Proceedings of CRYPTO 82, pp. 199–203, 1982.
  2. M. Mambo, K. Usuda, and E. Okamoto, “Proxy signatures for delegating signing operation,” in Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp. 48–56, ACM Press, March 1996. View at Scopus
  3. A. Shamir, “Identity-based cryptosystems and signature schemes,” in Advances in Cryptology, vol. 196 of Lecture Notes in Computer Science, pp. 47–53, Springer, Berlin, Germany, 1985. View at Publisher · View at Google Scholar
  4. W. D. Lin and J. K. Jan, “A security personal learning tools using a proxy blind signature scheme,” in Proceedings of International Conference on Chinese Language Computing, pp. 273–277, Chicago, Ill, USA, 2000.
  5. A. K. Awasthi and S. Lal, “Proxy blind signature scheme,” Transaction on Cryptology, vol. 2, no. 1, pp. 5–11, 2005. View at Google Scholar
  6. H. M. Sun, B. T. Hsieh, and S. M. Tseng, “On the security of some proxy blind signature schemes,” Journal of Systems and Software, vol. 74, no. 3, pp. 297–302, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. F. Zhang, R. Safavi-Naini, and C.-Y. Lin, “New Proxy Signature, Proxy Blind Signature and Proxy Ring Signature Schemes from Bilinear Pairing,” Cryptology ePrint Archive, 2003, http://eprint.iacr.org/2003/104.
  8. D. Zheng, Z. Huang, K. Chen, and W. D. Kou, “Id-based proxy blind signature,” in Proceedings of the 18th International Conference on Advanced Information and Applications, vol. 74, pp. 380–383, IEEE Computer Society, 2004.
  9. W. Lang, Z. Yang, and Y. Tang, “An identity-bas ed proxy blind signature scheme from bilinear pairings,” Asian Journal of Information Technology, vol. 3, no. 10, pp. 839–842, 2004. View at Google Scholar
  10. Q. Zhang, Q. Wen, and G. Chen, “Efficient ID-based proxy blind signature scheme,” Wuhan University Journal of Natural Sciences, vol. 12, no. 1, pp. 105–108, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. M. Yang and Y. Wang, “A new efficient ID-based proxy blind signature scheme,” Journal of Electronics, vol. 25, no. 2, pp. 226–231, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Ajtai, “Generating hard instances of lattice problems,” in Proceedings of the STOC, pp. 99–108, New York, NY, USA, 1996.
  13. O. Regev, “Lattice-based cryptography,” in Advances in Cryptology (CRYPTO '06), vol. 4117 of Lecture Notes in Computer Science, pp. 131–141, 2006. View at Google Scholar
  14. G. Craig, C. Peikert, and V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in Proceedings of the S-TOC, pp. 197–206, 2008.
  15. M. Rückert, “Lattice-based blind signatures,” in Advances in Cryptology—ASIACRYPT 2010, vol. 6477 of Lecture Notes in Computer Science, pp. 413–430, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  16. S. D. Gordon, J. Katz, and V. Vaikuntanathan, “A group signature scheme from lattice assumptions,” in Advances in Cryptology—ASIACRYPT 2010, vol. 6477 of Lecture Notes in Computer Science, pp. 395–412, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. M. R{\"u}ckert, “Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles,” in Post-Quantum Cryptography, vol. 6061 of Lecture Notes in Computer Science, pp. 182–200, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. Y. Jiang, F. Kong, and X. Ju, “Lattice-based proxy signature,” in Proceeding of the International Conference on Computational Intelligence and Security (CIS '10), pp. 382–385, Nanning, China, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Tian and L. Huang, “Breaking a proxy signature scheme from lattices,” International Journal of Network Security, vol. 14, no. 6, pp. 320–323, 2012. View at Google Scholar · View at Scopus
  20. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, “Bonsai trees, or how to delegate a lattice basis,” in Advances in Cryptology—EUROCRYPT 2010LNCS, vol. 6110 of Lecture Notes in Computer Science, pp. 523–552, 2010. View at Google Scholar
  21. L. L. Zhang and Y. Sang, “A lattice-based identity-based proxy signature from bonsai trees,” International Journal of Advancements in Computing Technology, vol. 4, no. 20, pp. 99–104, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. F. Xia, B. Yang, S. Ma, H. Sun, and M. Zhang, “Lattice-based proxy signature scheme,” Journal of Hunan University, vol. 38, no. 6, pp. 84–88, 2011. View at Google Scholar · View at MathSciNet · View at Scopus
  23. S. Agrawal, D. Boneh, and X. Boyen, “Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE,” in Advances in Cryptology—{CRYPTO} 2010, vol. 6223 of Lecture Notes in Computer Science, pp. 98–115, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus