Chameleon hashes without key exposure based on factoring

Journal of Computer Science and Technology

Volumn 22, Issue 1, 2007, Pages 109-113

  Gao, Wei ^a   Wang, Xue Li ^b   Xie, Dong Qing ^a  

^a HUNAN UNIVERSITY   (China)

^b SOUTH CHINA NORMAL UNIVERSITY   (China)

Author keywords

Chameleon hash; Chameleon signature; Key exposure

Indexed keywords

CHAMELEON HASH; CHAMELEON SIGNATURE; KEY-EXPOSURE;

COMPUTER CRIME; DATA PRIVACY; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33847010568     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-007-9015-9     Document Type: Article

References (13)

1. Krawczyk H, Rabin T. Chameleon signatures. In Proc. Symposium on Network and Distributed System Security Sympo sium (NDSS 3000), San Diego, CA, February, 2000, pp.143-154.
2. Ateniese G, de Medeiros B. Identity-based chameleon hash and applications. In Proc. Financial Cryptography (FC'04), Key West, Florida, USA, February 9-12, 2004, Springer-Verlag, LNCS 3110, pp.164-180.
3. Chen X, Zhang F, Kim K. Chameleon hashing without key exposure. In Proc. the 7th Information Security Conference (ISC'04), Palo Alto, USA, September 27-29, 2004, SpringerVerlag, LNCS 5225, pp.87-98.
4. Ateniese G, de Medeiros B. On the key exposure problem in chameleon hashes. In Proc. the 4th Conference on Security in Communication Networks (SCN'04), Amalfi, Italy, September 8-10, 2004, Springer-Verlag, LNCS 5552, pp.165-179.
5. MacKenzie P, Yang K. On simulation-sound trapdoor commitments. In Proc. EUROCRYPT'04, Interlaken, Switzerland, May 2-6, 2004, Springer-Verlag, LNCS 5027, pp.382-400.
6. Gennaro R. Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. In CRYPTO'04, Santa Barbara, California, USA, August 15-19, 2004, Springer-Verlag, LNCS 3152, pp. 220-236.
7. Hu L, Dong J, Pei D. Implementation of cryptosystems based on Tate pairing. J. Comput. Sci. & Technol, 2005, 20(2): 264-269.
8. Rabin M. Digital signatures. Foundations of Secure Computation. Dobkin D, Jones A, Lipton R (eds.), New York: Academic Press, 1978, pp.155-168.
9. Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. the 1st ACM Conf. Computer and Communications Security, Fairfax, VA, November 3-5, 1993, pp.62-73.
10. Goldwasser S, Micali S, Rivest R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 1998, 17(2): pp. 281-308.
11. Bellare M, Namprempre C, Neven G. Security proofs for identity-based identification and signature schemes. In Proc. Eurocrypt'2004, Interlaken, Switzerland, May 2-6, 2004, Springer-Verlag, LNCS 5027, pp. 268-286.
12. Bellare M, Rogaway P. The exact security of digital signatures: How to sign with RSA and Rabin. In Proc. Eurocrypt 96, Zaragoza, Spain, May 12-16, 1996, Springer-Verlag, LNCS 1070, pp.399-416.
13. Fischlin M, Fischlin R. The representation problem based on factoring. In Proc. the Cryptographer's Track at the RSA Conference on Topics in Cryptology 2002 (Topics in Cryptology-CT-RSA 2002), San Jose, CA, USA, February 18-22, 2002, Springer-Verlag, LNCS 2271, pp.96-113.