Similar articles

Abstract: 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.

再议防二重认证签名：新定义和基于变色龙哈希的构造

[1]Ateniese G, de Medeiros B, 2004a. Identity-based chameleon hash and applications. Int Conf on Financial Cryptography, p.164-180.

[2]Ateniese G, de Medeiros B, 2004b. On the key exposure problem in chameleon hashes. Int Conf on Security in Communication Networks, p.165-179.

[3]Bellare M, Ristov T, 2014. A characterization of chameleon hash functions and new, efficient designs. J Cryptol, 27(4):799-823.

[4]Bellare M, Halevi S, Sahai A, et al., 1998. Many-to-one trapdoor functions and their relation to public-key cryptosystems. Annual Int Cryptology Conf, p.283-298.

[5]Chaum D, Fiat A, Naor M, 1988. Untraceable electronic cash. Conf on the Theory and Application of Cryptography, p.319-327.

[6]Chen X, Zhang F, Kim K, 2004. Chameleon hashing without key exposure. Int Conf on Information Security, p.87-98.

[7]Chen X, Zhang F, Susilo W, et al., 2007. Efficient generic on-line/off-line signatures without key exposure. Int Conf on Applied Cryptography and Network Security, p.18-30.

[8]Chen X, Zhang F, Tian H, et al., 2011. Discrete logarithm based chameleon hashing and signatures without key exposure. Comput Electr Eng, 37(4):614-623.

[9]Chen X, Zhang F, Susilo W, et al., 2014. Identity-based chameleon hashing and signatures without key exposure. Inform Sci, 265(5):198-210.

[10]Chor B, Fiat A, Naor M, et al., 2000. Tracing traitors. IEEE Trans Inform Theory, 46(3):893-910.

[11]Fischlin M, 2001. Trapdoor Commitment Schemes and Their Applications. PhD Thesis, Goethe Universitat Frankfurt, Germany.

[12]Fischlin M, Fischlin R, 2000. Efficient non-malleable commitment schemes. Annual Int Cryptology Conf, p.413-431.

[13]Fu Z, Ren K, Shu J, et al., 2016. {Enabling personalized search over encrypted outsourced data with efficiency improvement}. IEEE Trans Parall Distr Syst, 27(9):2546-2559.

[14]Gao W, Wang X, Xie D, 2007. Chameleon hashes without key exposure based on factoring. J Comput Sci Technol, 22(1):109-113.

[15]Gao W, Li F, Wang X, 2009. Chameleon hash without key exposure based on Schnorr signature. Comput Stand Inter, 31(2):282-285.

[16]Gennaro R, 2004. Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. Annual Int Cryptology Conf, p.220-236.

[17]Girault M, 1991. Self-certified public keys. Workshop on the Theory and Application of Cryptographic Techniques, p.490-497.

[18]Goldwasser S, Micali S, Rivest R, 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput, 17(2):281-308.

[19]Goyal V, 2007. Reducing trust in the PKG in identity based cryptosystems. Annual Int Cryptology Conf, p.430-447.

[20]Krawczyk H, Rabin T, 2000. Chameleon signatures. 7^th Network and Distributed System Security Conf, p.143-154.

[21]Mohassel P, 2010. One-time signatures and chameleon hash functions. Int Workshop on Selected Areas in Cryptography, p.302-319.

[22]Pedersen TP, Pfitzmann B, 1997. Fail-stop signatures. SIAM J Comput, 26(2):291-330.

[23]Poettering B, Stebila D, 2014. Double-authentication-preventing signatures. 19^th European Symp on Research in Computer Security, p.436-453.

[24]Poettering B, Stebila D, 2017. Double-authentication-preventing signatures. Int J Inform Secur, 16(1):1-22.

[25]Soghoian C, Stamm S, 2011. Certified lies: detecting and defeating government interception attacks against SSL (short paper). Int Conf on Financial Cryptography and Data Security, p.250-259.