Journal of the Korea Institute of Information Security & Cryptology (정보보호학회논문지)

Korea Institute of Information Security and Cryptology (한국정보보호학회)
권호 표지
DOI QR코드

DOI QR Code

Cryptanalysis on Two Recent Group Signature Schemes

최근 제안된 두 그룹서명기법의 암호분석

  • Received : 2010.04.26
  • Accepted : 2010.07.30
  • Published : 2010.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

Unlinkability and traceability are basic security requirements of a group signature scheme. In this paper, we analyze two recent group signature schemes, Lee et al.'s scheme and Zhu et al.'s scheme. We show that Lee et al,'s scheme does not work correctly. Further, it fails to meet unlinkability, that is, anyone who intercepts or receives group signatures are able to check if they are from the same signer. We also show that Zhu et al.'s scheme is unable to satisfy traceability, that is, a malicious group member can generate valid group signatures that cannot be opened. Moreover, once becoming group member, the malicious group member will never be revoked from group. Besides, Zhu et al.'s scheme fails to satisfy forward security, a requirement claimed by authors.

연결불가능성(unlinkability)과 추적불가능성(traceability)은 그룹-서명이 만족해야 하는 기본적인 요구사항이다. 본 논문에서 최근 Lee등과 Zhu등에 의해서 제안된 두 그룹 서명기법들이 갖는 취약점을 분석하였다. Lee등의 기법은 합법적인 서명자가 생성한 서명을 검증할 수 없는 설계상의 치명적인 문제를 갖고 있으며, 검증과정이 안고 있는 문제와 별개로 동일한 서명자가 생성한 서명을 항상 링크할 수 있음을 보인다. 또, Zhu등의 그룹서명기법에서 그룹의 관리자가 추적할 수 없도록 서명을 생성하는 것이 가능함을 보이고, 저자들의 주장과 달리, 그들의 기법이 전방향 안전성을 만족하지 않음을 보인다.

Keywords

References

  1. Giuseppe Ateniese, Jan Camenisch, Marc Joye, and Gene Tsudik, "A practical and provably secure coalition-resistant group signature scheme," Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag, pp. 255-270, 2000.
  2. Giuseppe Ateniese, Dawn Song, and Gene Tsudik, "Quasi-efficient revocation of group signatures," Proceedings of Financial Cryptography 2002, pp. 183-197, Mar. 2002.
  3. M. Bellare, D. Micciancio, and B. Warinschi, "Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions," Proccedings of Eurocrypt 2003, LNCS 2656, pp. 614-629, 2003.
  4. Jan Camenisch and Anna Lysyanskaya, "Signature schemes and anonymous credentials from bilinear maps," Advances in Cryptology-CRYPTO 2004, LNCS 3152, Springer-Verlag, 2004.
  5. D. Chaum, and E.V. Heyst, "Group signatures," Advances in Cryptology- EuroCrypt91, LNCS 547, Springer-Verlag, pp. 257-265, 1991.
  6. Cheng-Chi Lee, Ting-Yi Chang, Min- Shiang Hwang, "A New Group Signature Scheme Based on the Discrete Logarithm," Journal of Information Assurance and Security, vol. 5, no. 1, pp. 054 - 057, 2010.
  7. W.B. Lee and C.C. Chang, "Efficient group signature scheme based on the discrete logarithm," IEE Proc.-Computer Digital Technology, vol. 145, no. 1, pp. 15-18, Jan. 1998. https://doi.org/10.1049/ip-cdt:19981599
  8. Dawn Xiaodong Song, "Practical forward secure group signature schemes," ACM Conference on Computer and Communications Security 2001, pp. 225-234, Nov. 2001.
  9. Hung-Min Sun, "Comment improved group signature scheme based on discrete logarithm problem," IEE Electronics Letters, vol. 35, no. 16, pp. 1323-1324, Apr. 1999. https://doi.org/10.1049/el:19990906
  10. Yuh-Min Tseng and Jinn-Ke Jan, "Improved group signature scheme based on discrete logarithm problem," IEE Electronics Letters vol. 35, no. 1, pp. 37-38, Jan. 1999. https://doi.org/10.1049/el:19990071
  11. Jianhua Zhu, Guohua Cui, and Shiyang Zhou, "Two Group Signature Schemes with Multiple Strategies Based on Bilinear Pairings," I.J. Information Technology and Computer Science, vol. 1, no. 1, pp. 16-22, Nov. 2009. https://doi.org/10.5815/ijitcs.2009.01.03
  12. Guohua Cui, Jianhua Zhu, and Shiyang Zhou, "A Group Signature Schemes with Multiple Strategies Based on Bilinear Pairings," 2009 First International Workshop on Education Technology and Computer Science, IEEE, vol. 3, pp. 848-852, Mar. 2009.