Double-authentication-preventing signatures revisited: new definition and construction from chameleon hash

• Published in: Frontiers of information technology & electronic engineering Vol. 20; no. 2; pp. 176 - 186
• Main Authors: Li, Fei, Gao, Wei, Wang, Gui-lin, Chen, Ke-fei, Tang, Chun-ming
• Format: Journal Article
• Language: English
• Published: Hangzhou Zhejiang University Press 01.02.2019; Springer Nature B.V; Key Laboratory of Information Security, Guangzhou University, Guangzhou 510006, China; China-USA Computer Science Research Center, Nanjing University of Information Science and Technology, Nanjing 210044, China%Shield Lab, Singapore Research Center of Huawei, 117674, Singapore%Department of Mathematics, Hangzhou Normal University, Hangzhou 311121, China%Key Laboratory of Information Security, Guangzhou University, Guangzhou 510006, China; School of Mathematics and Statistics, Ludong University, Yantai 264025, China
• Subjects: Communications Engineering; Computer Hardware; Computer Science; Computer Systems Organization and Communication Networks; Cryptography; Electrical Engineering; Electronics and Microelectronics; Instrumentation; Networks; Public Key Infrastructure; Signatures; Chameleon hash function; Digital signature; Provable security; Authority trust level; TP309; Double-authentication-preventing signatures
• ISSN: 2095-9184; 2095-9230
• DOI: 10.1631/FITEE.1700005

Double-authentication-preventing signature (DAPS) is a novel signature notion proposed at ESORICS 2014. The double-authentication-preventing property means that any pair of signatures on two different messages with the same subject will result in an immediate collapse of the signature system. A few potential applications of DAPS have been discussed by its inventors, such as providing a kind of self-enforcement to discourage certificate authority (CA) from misbehaving in public key infrastructure and offering CA some cryptographic arguments to resist legal coercion. In this study, we focus on some fundamental issues on DAPS. We propose a new definition, which is slightly weakened but still reasonable and strong enough to capture the DAPS concept. We develop the new notion of invertible chameleon hash functions with key exposure. Then we propose a generic DAPS scheme, which is provably secure if the underlying invertible chameleon hash function with key exposure is secure. We instantiate this general construction to obtain the DAPS schemes respectively based on the well-known assumptions of integer factorization, Rivest-Shamir-Adleman (RSA), and computational Diffie-Hellman (CDH). They are more efficient than previous DAPS schemes. Furthermore, unlike previous constructions, the trusted setup condition is not needed by our DAPS schemes based on RSA and CDH.