Cryptanalysis of two signature schemes based on bilinear pairings in CISC '05

  • Authors:
  • Haeryong Park;Zhengjun Cao;Lihua Liu;Seongan Lim;Ikkwon Yie;Kilsoo Chun

  • Affiliations:
  • Korea Information Security Agency (KISA), Seoul, Korea;Department of Mathematics, Shanghai University, Shanghai, China;Department of Information and Computation Sciences, Shanghai Maritime University, Shanghai, China;Department of Mathematics, Inha University, Incheon, Korea;Department of Mathematics, Inha University, Incheon, Korea;Korea Information Security Agency (KISA), Seoul, Korea

  • Venue:
  • Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The bilinearity of pairings allows efficient signature verification for signature schemes based on discrete logarithm type problem and often provides useful additional functionalities to signature schemes. In recent years, bilinear pairings have been widely used to create signature schemes. But the bilinearity can also be an attack point in uncarefully designed protocols. We cryptanalyze two signature schemes presented at CISC '05, Cheng et al.'s group signature scheme and Gu et al.'s ID-based verifiably encrypted signature scheme, both based on bilinear pairings. We show that their improper uses of a bilinear pairing lead to untraceable group signatures for Cheng et al.'s group signature scheme and universally forgeable signatures for Gu et al.'s ID-based verifiably encrypted signature scheme.