On the key exposure problem in chameleon hashes

Lecture Notes in Computer Science

Volumn 3352, Issue , 2005, Pages 165-179

  Ateniese, Giuseppe ^a   De Medeiros, Breno ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b Florida State University   (United States)

Author keywords

Chameleon hashing; Chameleon signatures; Collision resistant hashing; Digital signatures; Trapdoor commitments; Undeniable signatures

Indexed keywords

CRYPTOGRAPHY; FUNCTIONS; PROBLEM SOLVING;

CHAMELEON HASHING; CHAMELEON SIGNATURES; COLLISION-RESISTANT HASHING; TRAPDOOR COMMITMENTS; UNDENIABLE SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 23944526438     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30598-9_12     Document Type: Conference Paper

References (20)

1. Ateniese, G., de Medeiros, B.: Identity-based chameleon hash and applications. In Financial Cryptography 2004. LNCS 3110, Springer-Verlag (2004) 164-180. Available online at http://eprint.iacr.org/2003/167/.
2. Bellare, M., Rogaway, P.: PSS: Provably secure encoding method for digital signature. IEEE P1363a: Provably secure signatures, http://grouper.ieee. org/groups/1363/p1363a/pssigs.html (1998)
3. Boneh, D. and Boyen, X.: Short Signatures Without Random Oracles, Proc. of Advances in Cryptology - EUROCRYPT '04, Volume 3027 of LNCS Springer-Verlag (2004) 56-73
4. Brassard, G., Chaum, D., and Crepeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer an Systems Sciences, vol. 37 no. 2, (1988) 156-189.
5. Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.Q.: Paillier's Cryptosystem Revisited. ACM CCS 2001.
6. Chaum, D., Antwerpen, H.: Undeniable signatures. In: Advances in Cryptology - CRYPTO'89. Volume 435 of LNCS., Springer-Verlag (1991) 212-216
7. Chen, X., Zhang, F., and Kim, K.: Chameleon hashing without key exposure. To appear in the proceedings of the 7th Information Security Conference (ISC '04), Palo Alto, California. Available online at http://eprint.iacr.org/2004/ 038/.
8. Damgård, I.: Practical and provable secure release of a secret and exchange of signature. In: Journal of Cryptology, Volume 8. Springer-Verlag (1995) 201-222
9. Even S., Goldreich O., Micali S.: On-line/off-line Digital Signatures. In: Advances in Cryptology - CRYPTO '89. LNCS of Springer-Verlag, 263-277. August 1990.
10. Fischlin, M.: Trapdoor commitment schemes and their applications. Ph.D. thesis, 2001.
11. Gennaro, R.: Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. In: Advances in Cryptology - CRYPTO '04. LNCS of Springer-Verlag. August 2004.
12. Krawczyk, H., Rabin, T.: Chameleon signatures. In: Proceedings of NDSS 2000. (2000) 143-154
13. MacKenzie, P. and Yang, K.: On Simulation-Sound Trapdoor Commitments. In: Proc. of Advances in Cryptology - EUROCRYPT '04. Volume 3027 of LNCS, Springer-Verlag (2004) 382-400
14. Naccache, D., Pointcheval, D., and Stern, J.: Twin signatures: an alternative to the hash-and-sign paradigm. In: Proc. of the 8th ACM Conference on Computer and Communication Security (ACM CCS), ACM Press (2001) 20-27
15. Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Proc. of Advances in Cryptology - CRYPTO '92. Volume 740 of LNCS, Springer-Verlag (1992) 31-53
16. Paillier, P.: Public key cryptosystems based on composite degree residuosity classes. In: Proc. of Advances in Cryptology - EUROCRYPT '99. Volume 1592 of LNCS, Springer-Verlag (1999) 223-238
17. Pedersen, T. Non-interactive and information-theoretic secure verifiable secret sharing. In: Proc. of Advances in Cryptology - CRYPTO '91. Volume 576 of LNCS, Springer-Verlag (1991) 129-149
18. RSA Labs: RSA Crypt. Std: EMSAPSS - PKCS#1 v2.1., pp. 26-28, 32-37 (2002)
19. RSA Labs: RSA Crypt. Std: EMSAPKCS1-v1_5 - PKCS#1 v2.1. pp. 29-33, 37-38 (2002)
20. Shamir A, Kalai, Y.: Improved Online/Offline Signature Schemes. In: Proc. of Advances in Cryptology - CRYPTO'01, Volume 2139 of LNCS. Springer-Verlag (2001) 355-367.