Comments on the Security Proofs of Some Signature Schemes Based on Factorization

Wakaha OGATA
Naoya MATSUMOTO

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A    No.2    pp.526-530
Publication Date: 2007/02/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.2.526
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Security
Keyword: 
digital signature,  Rabin-type signature,  random oracle model,  simulation,  factorization,  

Full Text: PDF(98.5KB)>>
Buy this Article



Summary: 
We study on the security proof of the improved efficient-Rabin (ERabin) scheme and the F-FDHS scheme. First, we show that the security theorem of the improved ERabin scheme is not correct, and then provide a correct theorem for it. Second, we show that the security theorem of the F-FDHS scheme lacks an assumption. Finally, we present a way to modify the improved ERabin scheme and the F-FDHS scheme.


open access publishing via