Journal of Communications and Networks

  • 제15권1호
  • /
  • Pages.1-7
  • /
  • 2013
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

Identity-Based Proxy Signature from Lattices

  • Kim, Kee Sung (Graduate School of Information Security, CIST, Korea University) ;
  • Hong, Dowon (Department of Applied Mathematics, Kongju National University) ;
  • Jeong, Ik Rae (Graduate School of Information Security, CIST, Korea University)
  • 투고 : 2012.01.17
  • 심사 : 2012.04.02
  • 발행 : 2013.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

키워드

과제정보

연구 과제 주관 기관 : National Research Foundation of Korea (NRF)

참고문헌

  1. M. Mambo, K. Usuda, and E. Okamoto, "Proxy signature: Delegation of the power to sign messages," IEICE Trans. Fundamentals, vol. E79-A(9), pp. 1338-1353, 1996.
  2. S. Kim, S. Park, and D.Won, "Proxy signatures, revisited," in Proc. ICICS, vol. 1334, 1997, pp. 223-232.
  3. T. Okamoto, M. Tada, and E. Okamoto, "Extended proxy signatures for smart cards," in Proc. Inf. Security, vol. 1729, 1999, pp. 247-258.
  4. B. Lee, H. Kim, and K. Kim, "Secure mobile agent using strong nondesignated proxy signature," in Proc. ACISP, vol. 2119, 2001, pp. 474- 486.
  5. G. Wang, F. Bao, J.Zhou, and R. H. Deng, "Security analysis of some proxy signatures," in Proc. ICISC, vol. 2971, 2004, pp. 305-319.
  6. T. Okamoto, A. Inomata, and E. Okamoto, "A proposal of short proxy signature using pairing," in Proc. ITCC, 2005, pp. 631-635.
  7. J. Xu, Z. Zhang, and D. Feng, "ID-based proxy signature using bilinear pairings," in Proc. ISPA, vol. 3759, 2005, pp. 359-367.
  8. W. Wu, Y. Mu, W. Susilo, J. Seberry, and X. Y. Huang, "Identity-based proxy signature from pairing," in Proc. ATC, vol. 4610, 2007, pp. 22-31.
  9. P. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," J. Comput., pp. 1484-1509, Oct. 1997.
  10. A. Boldyreva, A. Palacio, and B. Warinschi, "Secure proxy signature schemes for delegation of signing rights," J. Cryptology, vol. 25, pp 57-115, Jan. 2012. https://doi.org/10.1007/s00145-010-9082-x
  11. D. Galindo, J. Herranz, and E. Kiltz, "On the generic construction of identity-based signatures with additional properties," in Proc. ASIACRYPT, 2006, pp. 178-193.
  12. C. Gentry, C. Peikert, and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions," in Proc. ACM Theory of Comput., 2008, pp. 197-206.
  13. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, "Bonsai trees, or how to delegate a lattice basis," in Proc. Eurocrypt, vol. 6110, 2010, pp. 523-552.
  14. X. Boyen, "Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more," in Proc. PKC, vol. 6056, 2010, pp. 499- 517.
  15. Y. Jiang, F. Kong, and X. Ju, "Lattice-based proxy signature, in Proc. Int. Conf. CIS, 2010, pp.382-385.
  16. C. Wang and M. Qi, "Lattice-based proxy signature scheme," J. Inf. & Comput. Sci., vol. 8 (12), pp. 2451-2458, 2011.
  17. S. Agrawal, D. Boneh, and X. Boyen, "Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE," in Proc. CRYPTO, vol. 6223, 2010, pp. 98-115.
  18. M. Ajtai, "Generating hard instance of the short basis problem," in Proc. Automata, Languages, and Programming, vol. 1644, 1999, pp. 1-9.
  19. J. Alwen and C. Peikert, "Generating shorter bases for hard random lattices," Theory of Comput. Syst., vol. 09001, pp. 75-86, 2009.
  20. D.Micciancio and O. Regev, "Worst-case to average-case reductions based on gaussian measures," J. Comput., vol.37(1), pp.267-302, 2007.
  21. D. Micciancio and S. Goldwasser, Complexity of Lattice Problems: A Cryptographic Perspective. MA: Kluwer Academic Publishers, 2002.
  22. M. Ajtai, "Generating hard instance of lattice problems," in Proc. ACM Thoery Comput., 1996, pp. 99-108.