Strong non‐repudiation based on certificateless short signatures. Issue 3 (1st September 2013)

• Record Type: Journal Article
• Authors: Chen, Yu‐Chi; Horng, Gwoboa; Liu, Chao‐Liang
• Is Part Of: IET information security. Volume 7:Issue 3(2013)
• Page Start: 253
• Page End: 263
• Publication Date: 2013-09-01
• Subjects: cryptography -- digital signatures; certificateless short signature scheme -- strong nonrepudiation -- CLS scheme -- security model -- computational Diffie‐Hellman problem; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2012.0134
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : In this study, the authors consider certificateless signature (CLS) schemes for strong non‐repudiation. They show that previous security models which ensure that any user can have a unique key pair cannot guarantee a CLS scheme to achieve strong non‐repudiation. The authors then fix the security model and propose a new CLS scheme which provides strong non‐repudiation under the new model, assuming the computational Diffie–Hellman problem is intractable.