Title :
A revised enhanced short signature scheme with hybrid problems
Author :
Li, Wei ; Lv, Ke-Wei ; Yao, Gang
Author_Institution :
State Key Lab. of Inf. Securiy, Grad. Univ. of Chinese Acad. of Sci., Beijing, China
Abstract :
Knapsack Diffie-Hellman problem with bilinear parings(KDH), proposed by Han et al, has been proved as hard as Subset Sum problem. Enhanced short signature scheme with hybrid problems is a signature scheme proposed by Su based on KDH problem. In this paper, we present a message attack that the adversary can easily forged a signature by capturing only one message and its signature. Then, we present a revised signature scheme against this kind of attack. Finally, we discuss the hardness between problem DLP, k-CAA´ and k-wCDHP.
Keywords :
computer crime; cryptography; digital signatures; knapsack problems; set theory; DLP; KDH problem; Knapsack Diffie-Hellman problem; bilinear parings; hybrid problems; k-CAA; k-wCDHP; message attack; revised enhanced short signature scheme; signature forging; subset sum problem; Digital signatures; Forgery; Polynomials; Public key; Cryptography; Diffie-Hellman problem; Security; Short signature scheme;
Conference_Titel :
Computer Science and Automation Engineering (CSAE), 2012 IEEE International Conference on
Conference_Location :
Zhangjiajie
Print_ISBN :
978-1-4673-0088-9
DOI :
10.1109/CSAE.2012.6272680
