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

An Efficient Homomorphic Aggregate Signature Scheme Based on Lattice

1Department of Computer Engineering, Jiangsu University of Technology, Changzhou 213001, China
2Department of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China

Received 19 June 2014; Accepted 15 September 2014; Published 6 November 2014

Academic Editor: Guoqiang Zhang

Copyright © 2014 Zhengjun Jing. 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. R. Johnson, D. Molnar, D. Song, and D. Wagner, “Homomorphic signature schemes,” in Proceedings of the Cryptology (CT-RSA '02), pp. 244–262, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  2. D. Boneh, D. Freeman, J. Katz, and B. Waters, “Signing a linear subspace: signature schemes for network coding,” in Public Key Cryptography—PKC 2009, vol. 5443 of Lecture Notes in Computer Science, pp. 68–87, Springer, Berlin, Germany, 2009. View at Google Scholar
  3. R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin, “Secure network coding over the integers,” in Public Key Cryptography—PKC 2010, vol. 6056 of Lecture Notes in Computer Science, pp. 142–160, Springer, Berlin, Germany, 2010. View at Google Scholar
  4. D. Freeman, “Improved security for linearly homomorphic signatures: a generic framework,” in Public Key Cryptography—PKC 2012, Lecture Notes in Computer Science, pp. 697–714, Springer, Berlin, Germany, 2012. View at Google Scholar
  5. D. Boneh and D. M. Freeman, “Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures,” in Public Key Cryptography—PKC, Lecture Notes in Computer Science, pp. 1–16, Springer, Heidelberg, Germany, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Boneh and D. M. Freeman, “Homomorphic signatures for polynomial functions,” in Advances in cryptology—{EUROCRYPT} 2011, vol. 6632 of Lecture Notes in Computer Science, pp. 149–168, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. F. Wang, Y. Hu, and B. Wang, “Lattice-based linearly homomorphic signature scheme over binary field,” Science China Information Sciences, vol. 56, no. 11, pp. 1–9, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. J. H. Ahn, D. Boneh, J. Camenisch, S. Hohenberger, A. Shelat, and B. Waters, “Computing on authenticated data,” in Theory of Cryptography, vol. 7194 of Lecture Notes in Computer Science, pp. 1–20, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. N. Attrapadung, B. Libert, and T. Peters, “Computing on authenticated data: new privacy definitions and constructions,” in Advances in Cryptology—ASIACRYPT 2012, vol. 7658 of Lecture Notes in Computer Science, pp. 367–385, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. N. Attrapadung, B. Libert, and T. Peters, “Efficient completely context-hiding quotable and linearly homomorphic signatures,” in Public-Key Cryptography—PKC 2013, vol. 7778 of Lecture Notes in Computer Science, pp. 386–404, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  11. R. W. Yeung, “Multi-source network coding,” in Information Theory and Network Coding, pp. 505–540, Springer, 2008. View at Google Scholar
  12. Y. Wu, “On constructive multi-source network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT ’06), pp. 1349–1353, Seattle, Wash, USA, July 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Agrawal, D. Boneh, X. Boyen, and D. M. Freeman, “Preventing pollution attacks in multi-source network coding,” in Public Key Cryptography—PKC 2010, vol. 6056 of Lecture Notes in Computer Science, pp. 161–176, Springer, Berlin, Germany, 2010. View at Google Scholar
  14. L. Czap and I. Vajda, “Signatures for Multi-source Network Coding,” Cryptology ePrint Archive: Report 2010/328, http://eprint.iacr.org/2010/328.
  15. W. Yan, M. Yang, L. Li, and H. Fang, “Short signature scheme for multi-source network coding,” Computer Communications, vol. 35, no. 3, pp. 344–351, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Zhang, J. Yu, and T. Wang, “A homomorphic aggregate signature scheme based on lattice,” Chinese Journal of Electronics, vol. 21, no. 4, pp. 701–704, 2012. View at Google Scholar · View at Scopus
  17. D. Micciancio and O. Regev, “Worst-case to average-case reductions based on Gaussian measures,” SIAM Journal on Computing, vol. 37, no. 1, pp. 267–302, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. C. Gentry, C. Peikert, and V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC '08), pp. 197–206, 2008.
  19. X. Zhao and X. Wang, “An efficient identity-based signcryption from lattice,” International Journal of Security and Its Applications, vol. 8, no. 2, pp. 363–369, 2014. View at Google Scholar · View at Scopus
  20. J. Alwen and C. Peikert, “Generating shorter bases for hard random lattices,” in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS '09), vol. 3, pp. 75–86, 2009. View at Google Scholar · View at MathSciNet
  21. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, “Bonsai trees, or how to delegate a lattice basis,” in Advances in Cryptology—{EUROCRYPT} 2010, vol. 6110 of Lecture Notes in Computer Science, pp. 523–552, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. V. Lyubashevsky and D. Micciancio, “Asymptotically efficient lattice-based digital signatures,” in Theory of Cryptography, vol. 4948 of Lecture Notes in Computer Science, pp. 37–54, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar