Advertisement
Published in:
2006 | OriginalPaper | Chapter
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
Published in: Information Security and Cryptology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.