Table of Contents Author Guidelines Submit a Manuscript
Erratum

An erratum for this article has been published. To view the erratum, please click here.

Security and Communication Networks
Volume 2017, Article ID 1915239, 7 pages
https://doi.org/10.1155/2017/1915239
Research Article

An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant Model

1Department of Computer and Information Technology, Zhejiang Police College, Hangzhou, Zhejiang Province, China
2Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China
3Department of Computer Science and Engineering, University of North Texas, Denton, TX 76203, USA
4College of Information Engineering, China University of Geosciences, Wuhan, China
5Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, TX 78249, USA

Correspondence should be addressed to Xiaohui Yuan; ude.tnu@nauy.iuhoaix

Received 23 March 2017; Accepted 2 July 2017; Published 1 August 2017

Academic Editor: Mamoun Alazab

Copyright © 2017 Guomin Zhou et al. 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. P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (SFCS '94), pp. 124–134, IEEE, 1994. View at Publisher · View at Google Scholar
  2. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Review, vol. 41, no. 2, pp. 303–332, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. R. J. McEliece, “A public-key cryptosystem based on algebraic coding theory,” DSN Progress Report 42--44, pp. 114–116, 1978. View at Google Scholar
  4. R. L. Rivest, A. Shamir, and Y. Tauman, “How to leak a secret,” in Advances in Cryptology---ASIACRYPT, vol. 2248 of Lecture Notes in Comput. Sci., pp. 552–565, Springer, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  5. N. Shirsath Priyanka and K. BECOMP, “Data Sharing in Cloud Using Identity Based Ring Signature,” in Proceedings of the BECOMP K. Data Sharing in Cloud Using Identity Based Ring Signature. International Research Journal of Engineering and Technology, p. 07, 2015.
  6. B. Wang, B. Li, and H. Li, “Oruta: Privacy-preserving public auditing for shared data in the cloud,” IEEE Transactions on Cloud Computing, vol. 2, no. 1, pp. 43–56, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Shacham and B. Waters, “Efficient ring signatures without random oracles,” in Public Key Cryptography, vol. 4450 of Lecture Notes in Comput. Sci., pp. 166–180, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  8. J. Kar, “Online/off-line ring signature scheme with provable security,” in Proceedings of the 13th IEEE International Conference on Intelligence and Security Informatics, ISI 2015, p. 197, May 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. K. Wang, Y. Mu, and W. Susilo, “Identity-based quotable ring signature,” Information Sciences. An International Journal, vol. 321, Article ID 11586, pp. 71–89, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. S. Zeng, Q. Li, Z. Qin, and Q. Lu, “Non-interactive deniable ring signature without random oracles,” Security and Communication Networks, vol. 9, no. 12, pp. 1810–1819, 2016. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Zhang, Y. Hu, J. Xie, and M. Jiang, “Efficient ring signature schemes over NTRU Lattices,” Security and Communication Networks, vol. 9, no. 18, pp. 5252–5261, 2016. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Mohamed S E and A. Petzoldt, “Efficient Multivariate Ring Signature Schemes,” in IACR Cryptology ePrint Archive, p. 247, 247, 2017. View at Google Scholar
  13. E. Bresson, J. Stern, and M. Szydlo, “Threshold ring signatures and applications to ad-hoc groups,” in Advances in Cryptology, Lecture Notes in Comput. Sci., pp. 465–480, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  14. A. Petzoldt, S. Bulygin, and J. Buchmann, “A multivariate based threshold ring signature scheme,” Applicable Algebra in Engineering, Communication and Computing, vol. 24, no. 3-4, pp. 255–275, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. H. Wang and S. Han, “A provably secure threshold ring signature scheme in certificateless cryptography,” in Proceedings of the 2010 International Conference of Information Science and Management Engineering, ISME 2010, pp. 105–108, August 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. T. H. Yuen, J. K. Liu, M. H. Au, W. Susilo, and J. Zhou, “Threshold ring signature without random oracles,” in Proceedings of the 6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011, pp. 261–267, March 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Xiong, Z. Qin, F. Li, and J. Jin, “Identity-based threshold ring signature without pairings,” in Proceedings of the 2008 International Conference on Communications, Circuits and Systems, ICCCAS 2008, pp. 478–482, May 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. L. Dallot and D. Vergnaud, “Provably secure code-based threshold ring signatures,” in Cryptography and Coding, vol. 5921, pp. 222–235, Springer, 2009. View at Google Scholar
  19. C. Aguilar Melchor, P.-L. Cayrel, P. Gaborit, and F. Laguillaumie, “A new efficient threshold ring signature scheme based on coding theory,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 57, no. 7, pp. 4833–4842, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. N. T. Courtois, M. Finiasz, and N. Sendrier, “How to achieve a McEliece-based digital signature scheme,” in Advances in Cryptology---ASIACRYPT 2001, vol. 2248 of Lecture Notes in Comput. Sci., pp. 157–174, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  21. D. R. Stinson, Advances in Cryptology — CRYPTO’ 93, vol. 773, Springer, Berlin, Germany, 1994. View at Publisher · View at Google Scholar
  22. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, “On the Inherent Intractability of Certain Coding Problems,” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 384–386, 1978. View at Publisher · View at Google Scholar · View at Scopus
  23. D. Engelbert, R. Overbeck, and A. Schmidt, “A summary of McEliece-type cryptosystems and their security,” Journal of Mathematical Cryptology, vol. 1, no. 2, pp. 151–199, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus