Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 371924, 12 pages
http://dx.doi.org/10.1155/2014/371924
Research Article

Strongly Unforgeable Ring Signature Scheme from Lattices in the Standard Model

CIST (Center for Information Security Technologies), Korea University, Anam-dong, Seongbuk-gu, Seoul 136-713, Republic of Korea

Received 14 November 2013; Accepted 21 April 2014; Published 5 May 2014

Academic Editor: Jongsung Kim

Copyright © 2014 Geontae Noh 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. R. L. Rivest, A. Shamir, and Y. Tauman, “How to leak a secret,” in Advances in Cryptology—ASIACRYPT 2001, C. Boyd, Ed., vol. 2248 of Lecture Notes in Computer Science, pp. 552–565, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, “Anonymous identification in ad hoc groups,” in Advances in Cryptology—EUROCRYPT 2004, C. Cachin and J. Camenisch, Eds., vol. 3027 of Lecture Notes in Computer Science, pp. 609–626, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. A. Fiat and A. Shamir, “How to prove yourself: practical solutions to identification and signature problems,” in Advances in Cryptology—CRYPTO '86, A. M. Odlyzko, Ed., vol. 263 of Lecture Notes in Computer Science, pp. 186–194, Springer, Berlin, Germany, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. A. Bender, J. Katz, and R. Morselli, “Ring signatures: stronger definitions, and constructions without random oracles,” Journal of Cryptology, vol. 22, no. 1, pp. 114–138, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. H. Shacham and B. Waters, “Efficient ring signatures without random oracles,” in Public Key Cryptography—PKC 2007, T. Okamoto and X. Wang, Eds., vol. 4450 of Lecture Notes in Computer Science, pp. 166–180, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. C.-H. Wang and C.-Y. Liu, “A new ring signature scheme with signer-admission property,” Information Sciences, vol. 177, no. 3, pp. 747–754, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. I. R. Jeong, J. O. Kwon, and D. H. Lee, “Ring signature with weak linkability and its applications,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 8, pp. 1145–1148, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. S. S. M. Chow, “Blind signature and ring signature schemes: rehabilitation and attack,” Computer Standards & Interfaces, vol. 31, no. 4, pp. 707–712, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Y. Hwang, “A note on an identity-based ring signature scheme with signer verifiability,” Theoretical Computer Science, vol. 412, no. 8–10, pp. 796–804, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. C. A. Melchor, P.-L. Cayrel, P. Gaborit, and F. Laguillaumie, “A new efficient threshold ring signature scheme based on coding theory,” IEEE 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
  11. S. Zeng, S. Jiang, and Z. Qin, “An efficient conditionally anonymous ring signature in the random oracle model,” Theoretical Computer Science, vol. 461, pp. 106–114, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484–1509, 1997. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. 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), C. Dwork, Ed., pp. 197–206, May 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. Buchmann, R. Lindner, M. Rückert, and M. Schneider, “Post-quantum cryptography: lattice signatures,” Computing, vol. 85, no. 1-2, pp. 105–125, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, “Bonsai trees, or how to delegate a lattice basis,” Journal of Cryptology, vol. 25, no. 4, pp. 601–639, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. X. Boyen, “Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more,” in Public Key Cryptography—PKC 2010, P. Q. Nguyen and D. Pointcheval, Eds., vol. 6056 of Lecture Notes in Computer Science, pp. 499–517, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. M. Rückert, “Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles,” in Post-Quantum Cryptography, N. Sendrier, Ed., vol. 6061 of Lecture Notes in Computer Science, pp. 182–200, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. D. Micciancio and C. Peikert, “Trapdoors for lattices: simpler, tighter, faster, smaller,” in Advances in Cryptology—EUROCRYPT 2012, D. Pointcheval and T. Johansson, Eds., vol. 7237 of Lecture Notes in Computer Science, pp. 700–718, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. Z. Brakerski and Y. T. Kalai, “A framework for efficient signatures, ring signatures and identity based encryption in the standard model,” Cryptology ePrint Archive, report 2010/086, 2010http://eprint.iacr.org/2010/086.
  20. P. Cayrel, R. Lindner, M. Rückert, and R. Silva, “A lattice-based thresh-old ring signature scheme,” in Progress in Cryptology—LATINCRYPT 2010, M. Abdalla and P. S. L. M. Barreto, Eds., vol. 6212 of Lecture Notes in Computer Science, pp. 255–272, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  21. J. Wang and B. Sun, “Ring signature schemes from lattice basis delegation,” in Information and Communications Security, S. Qing, W. Susilo, G. Wang, and D. Liu, Eds., vol. 7043 of Lecture Notes in Computer Science, pp. 15–28, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  22. C. Aguilar Melchor, S. Bettaieb, X. Boyen, L. Fousse, and P. Gaborit, “Adapting Lyubashevsky's signature schemes to the ring signature setting,” in Progress in Cryptology—AFRICACRYPT 2013, A. Youssef, A. Nitaj, and A. E. Hassanien, Eds., vol. 7918 of Lecture Notes in Computer Science, pp. 1–25, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  23. J. H. An, Y. Dodis, and T. Rabin, “On the security of joint signature and encryption,” in Advances in Cryptology—EUROCRYPT 2002, L. R. Knudsen, Ed., vol. 2332 of Lecture Notes in Computer Science, pp. 83–107, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. D. Boneh and X. Boyen, “Short signatures without random oracles,” in Advances in Cryptology—EUROCRYPT 2004, C. Cachin and J. Camenisch, Eds., vol. 3027 of Lecture Notes in Computer Science, pp. 56–73, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. D. Boneh, E. Shen, and B. Waters, “Strongly unforgeable signatures based on computational Diffie-Hellman,” in Public Key Cryptography—PKC 2006, M. Yung, Y. Dodis, A. Kiayias, and T. Malkin, Eds., vol. 3958 of Lecture Notes in Computer Science, pp. 229–240, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. M. Ajtai, “Generating hard instances of lattice problems,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC '96), G. L. Miller, Ed., pp. 99–108, May 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. C. Peikert and A. Rosen, “Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices,” in Theory of Cryptography, S. Halevi and T. Rabin, Eds., vol. 3876 of Lecture Notes in Computer Science, pp. 145–166, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. W. Banaszczyk, “New bounds in some transference theorems in the geometry of numbers,” Mathematische Annalen, vol. 296, no. 1, pp. 625–635, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  30. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, The MIT Press, London, UK, 3rd edition, 2009. View at MathSciNet