How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

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

Volumn 4377 LNCS, Issue , 2007, Pages 357-371

  Steinfeld, Ron ^a   Pieprzyk, Josef ^a   Wang, Huaxiong ^a,b  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Digital signature; Provable security; Strong unforgeability; Transform; Trapdoor hash function

Indexed keywords

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL TRANSFORMATIONS; NETWORK SECURITY;

DSA SIGNATURES; PROVABLE SECURITY; SIGNATURE SCHEME; SIMPLE MODIFICATIONS; STRONG UNFORGEABILITY;

HASH FUNCTIONS;

EID: 85025802492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11967668_23     Document Type: Conference Paper

References (14)

1. D. Boneh and X. Boyen. Short Signatures without Random Oracles. In EURO-CRYPT 2004, volume 3027 of LNCS, pages 56–73, Berlin, 2004. Springer-Verlag.
2. D. Boneh, E. Shen, and B. Waters. Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. In PKC 2006, volume 3958 of LNCS, pages 229-240, Berlin, 2006. Springer-Verlag.
3. R. Canetti, S. Halevi, and J. Katz. Chosen-Ciphertext Security from Identity-Based Encryption. In Eurocrypt 2004, volume 3027 of LNCS, pages 207–222, Berlin, 2004. Springer-Verlag.
4. D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In CRYPTO ’91, volume 576 of LNCS, pages 470–484, Berlin, 1991. Springer-Verlag.
5. S. Contini, A.K. Lenstra, and R. Steinfeld. VSH, an Efficient and Provable Collision-Resistant Hash Function. In Eurocrypt 2006, volume 4004 of LNCS, pages 165–182, Berlin, 2006. Springer-Verlag.
6. R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security (ACM TISSEC), 3:161–185, 2000.
7. R. Gennaro, S. Halevi, and T. Rabin. Secure Hash-and-Sign Signatures Without the Random Oracle. In EUROCRYPT ’99, volume 1592 of LNCS, pages 123–139, Berlin, 1999. Springer-Verlag.
8. O. Goldreich. Foundations of Cryptography, Volume II. Cambridge University Press, Cambridge, 2004.
9. J. Katz and M. Yung. Scalable Protocols for Authenticated Group Key Exchange. In CRYPTO 2003, volume 2729 of LNCS, pages 110–125, Berlin, 2003. Springer-Verlag.
10. H. Krawczyk and T. Rabin. Chameleon Signatures. In NDSS 2000, 2000. Available at http://www.isoc.org/isoc/conferences/ndss/2000/proceedings/.
11. K. Kurosawa and S. Heng. The Power of Identification Schemes. In PKC 2006, volume 3958 of LNCS, pages 364–377, Berlin, 2006. Springer-Verlag.
12. National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2, January 2000.
13. A. Shamir and Y. Tauman. Improved Online/Offline Signature Schemes. In CRYPTO 2001, volume 2139 of LNCS, pages 355–367, Berlin, 2001. Springer-Verlag.
14. I. Teranishi, T. Oyama, and W. Ogata. General Conversion for Obtaining Strongly Existentially Unforgeable Signatures. In INDOCRYPT 2006. To Appear.Appear.