Chameleon hashing without key exposure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3225, Issue , 2004, Pages 87-98

  Chen, Xiaofeng ^a   Zhang, Fangguo ^a   Kim, Kwangjo ^b  

^a SUN YAT SEN UNIVERSITY   (China)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Chameleon hashing; Gap diffie hellman group; Key exposure

Indexed keywords

HASH FUNCTIONS; NETWORK SECURITY; SECURITY OF DATA;

CHAMELEON HASHING; CHAMELEON SIGNATURES; COMPUTATION DIFFIE-HELLMAN PROBLEM; GAP DIFFIE-HELLMAN GROUPS; KEY EXPOSURE; MESSAGE DIGESTS; NON REPUDIATION; NON-TRANSFERABILITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 35048828982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30144-8_8     Document Type: Article

References (25)

1. G. Ateniese and B. de Medeiros, Identity-based chameleon hash and applications, FC 2004, to appear. Cryptology ePrint Archive, http://eprint.iacr.org/2003/167.
2. S. Araki, S. Uehara, and K. Imamura, The limited verifier signature and its application, IEICE Trans. Fundamentals, vol.E82-A, No.l, pp.63-68, 1999.
3. F. Bao, R. Deng, and H. Zhu, Variations of Diffie-Hellman problem, ICICS 2003, LNCS 2836, pp.301-312, Springer-Verlag, 2003.
4. ' 4. D. Boyar, D. Chaum, and D. Damgård, Convertible undeniable signatures, Advances in Cryptology-Crypto 1990, LNCS 537, pp.183-195, Springer-Verlag, 1991.
5. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairings, Advances in Cryptology-Asiacrypt 2001, LNCS 2248, pp.514-532, Springer-Verlag, 2001.
6. J.C. Cha and J.H. Cheon, An identity-based signature from gap Diffie-Hellman groups, PKC 2003, LNCS 2567, pp.18-30, Springer-Verlag, 2003.
7. D. Chaum, Designated confirmer signatures, Advances in Cryptology-Eurocrypt 1994, LNCS 950, pp.86-91, Springer-Verlag, 1994.
8. D. Chaum, Zero-knowledge undeniable signatures, Advances in Cryptology-Eurocrypt 1990, LNCS 473, pp.458-464, Springer-Verlag, 1991.
9. D. Chaum and H. van Antwerpen, Undeniable signatures, Advances in Cryptology-Crypto 1989, LNCS 435, pp.212-216, Springer-Verlag, 1989.
10. X. Chen, F. Zhang and K. Kim, Limited verifier signature from bilinear pairings, ACNS 2004, LNCS 3089, pp.135-148, Springer-Verlag, 2004.
11. Y. Dodis, J. Katz, S. Xu, and M. Yung, Key-insulated public-key cryptosystems, Advances in Cryptology-Eurocrypt 2002, LNCS 2332, pp.65-82, Springer-Verlag, 2002.
12. Y. Desmedt, C. Goutier, and S. Bengio, Special uses and abuses of the Fiat-Shamir passport protocol, Advances in Cryptology-Crypto 1987, LNCS 293, pp.21-39, Springer-Verlag, 1988.
13. Y. Desmedt and M. Yung, Weaknesses of undeniable signature schemes, Advances in Cryptology-Eurocrypt 1991, LNCS 547, pp.205-220, Springer-Verlag, 1992.
14. S. Galbraith, W. Mao, and K. G. Paterson, RSA-based undeniable signatures for general moduli, CT-RSA 2002, LNCS 2271, pp.200-217, Springer-Verlag, 2002.
15. S. Galbraith and W. Mao, Invisibility and anonymity of undeniable and confirmer signatures, CT-RSA 2003, LNCS 2612, pp.80-97, Springer-Verlag, 2003.
16. S. Gennaro, H. Krawczyk, and T. Rabin, RSA-based undeniable signatures, Advances in Cryptology-Crypto 1997, LNCS 1294, pp.132-149, Springer-Verlag, 1997.
17. F. Hess, Efficient identity based signature schemes based on pairingss, SAC 2002, LNCS 2595, pp.310-324, Springer-Verlag, 2002.
18. M. Jakobsson, Blackmailing using undeniable signatures, Advances in CryptologyEurocrypt 1994, LNCS 950, pp.425-427, Springer-Verlag, 1994.
19. M. Jakobsson, K. Sako, and R. Impagliazzo, Designated verifier proofs and their applications, Advances in Cryptology-Eurocrypt 1996, LNCS 1070, pp.143-154, Springer-Verlag, 1996.
20. H. Krawczyk and T. Rabin, Chameleon hashing and signatures, Proc. of NDSS 2000, pp.143-154, 2000.
21. B. Libert and J. Quisquater, ID-based undeniable signatures, CT-RSA 2004, LNCS 2694, pp.112-125, Springer-Verlag, 2004.
22. U. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logatithms, Advances in Cryptology-Crypto 1994, LNCS 839, pp.271-281, Springer-Verlag, 1994.
23. T. Okamoto and D. Pointcheval, The gap-problems: a new class of problems for the security of cryptographic Schemes, PKC 2001, LNCS 1992, pp.104-118, Springer-Verlag, 2001.
24. R. Steinfeld, L. Bull, H. Wang, and J. Pieprzyk, Universal designated-verifier signatures, Advances in Cryptology-Asiacrypt 2003, LNCS 2894, pp.523-542, Springer-Verlag, 2003.
25. A. Sadeghi and M. Steiner, Assumptions related to discrete logarithms: why subtleties make a real difference, Advances in Cryptology-Eurocrypt 2001, LNCS 2045, pp.243-260, Springer-Verlag, 2001.