Generic transformation to strongly unforgeable signatures

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

Volumn 4521 LNCS, Issue , 2007, Pages 1-17

  Huang, Qiong ^a   Wong, Duncan S ^a   Zhao, Yiming ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT EXCHANGE; MESSAGE PASSING; ONLINE SYSTEMS;

GENERIC TRANSFORMATION; ON-LINE/OFF-LINE SIGNATURE; TRAPDOOR HASH FUNCTIONS; UNFORGEABLE SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38049006385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_1     Document Type: Conference Paper

References (30)

1. S. S. Al-Riyami and K. G. Paterson. Certificateless public key cryptography. In Proc. ASIACRYPT 2003, pages 452473. Springer-Verlag, 2003. LNCS 2894.
2. J. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Proc. EUROCRYPT 2002, pages 83107. Springer-Verlag, 2002. LNCS 2332.
3. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Proc. CRYPTO 2000, pages 255270. Springer-Verlag, 2000. LNCS 1880.
4. M. Bellare, C. Namprempre, and G. Neven. Security proofs for identity-based identi cation and signature schemes. In Proc. EUROCRYPT 2004, pages 268 286. Springer-Verlag, 2004.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 6273, Fairfax, 1993. ACM.
6. M. Bellare and S. Shoup. Tow-tier signatures, strongly unforgeable signatures, and at-shamir without random oracles. To appear in PKC 2007.
7. D. Boneh and X. Boyen. Short signatures without random oracles. In Proc. EUROCRYPT 2004, pages 5673, 2004. LNCS 3027.
8. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Proc. CRYPTO 2004, pages 4155, 2004. LNCS 3152.
9. D. Boneh, E. Shen, and B. Waters. Strongly unforgeable signatures based on computational Diffie-Hellman. In Proc. of PKC 2006, pages 229240. Springer- Verlag, 2006. LNCS 3958.
10. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In Proc. EUROCRYPT 2004, pages 207222. Springer-Verlag, 2004. LNCS 3027.
11. D. Chaum and E. V. Heyst. Group signatures. In Proc. EUROCRYPT 91, pages 257265. Springer-Verlag, 1991. LNCS 547.
12. I. Damgard. Collision free hash functions and public key signature schemes. In Proc. EUROCRYPT 87, pages 203216. Springer-Verlag, 1988. LNCS 304.
13. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM J. Computing, 30(2):391437, 2000.
14. S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. J. of Cryptology, 9(1), 1996.
15. O. Goldreich. Foundations of Cryptography, volume II, Basic Applications. Cambridge University Press, 2004.
16. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM J. Computing, 17(2):281308, Apr. 1988.
17. B. C. Hu, D. S. Wong, Z. Zhang, and X. Deng. Key replacement attack against a generic construction of certificateless signature. In Information Security and Privacy: 11th Australasian Conference, ACISP 2006, pages 235246. Springer-Verlag, 2006. LNCS 4058.
18. J. Katz and M. Yung. Scalable protocols for authenticated group key exchange. In Proc. CRYPTO 2003, pages 110125. Springer-Verlag, 2003. LNCS 2729.
19. L. Lamport. Constructing digital signatures from a one way function. Technical Report Technical Report CSL-98, SRI International, Oct. 1979.
20. K. U. M. Mambo and E. Okamoto. Proxy signature: Delegation of the power to sign messages. IEICE Trans. Fundamentals, E79-A(9):13381353, 1996.
21. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proc. of 21st ACM Symposium on the Theory of Computing, pages 3343, 1989.
22. National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186, Nov. 1994.
23. M. O. Rabin. Digitalized signatures. Foundations of Secure Computation, pages 155168, 1978.
24. L. Reyzin and N. Reyzin. Better than BiBa: Short one-time signatures with fast signing and verifying. In Information Security and Privacy: 7th Australasian Conference, ACISP 2002, pages 144153. Springer-Verlag, 2002. LNCS 2384.
25. R. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Proc. ASIACRYPT 2001, pages 552565. Springer-Verlag, 2001. LNCS 2248.
26. P. Rogaway and T. Shrimpton. Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In Proc. Fast Software Encryption 2004, pages 371388. Springer-Verlag, 2004. LNCS 3017.
27. A. Shamir. Identity-based cryptosystems and signature schemes. In Proc. CRYPTO 84, pages 4753. Springer, 1984. LNCS 196.
28. A. Shamir and Y. Tauman. Improved online/offine signature schemes. In Proc. CRYPTO 2001, pages 355367. Springer, 2001. LNCS 2139.
29. R. Steinfeld, J. Pieprzyk, and H. Wang. How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. In CT-RSA 2007, pages 357371. Springer-Verlag, 2007. LNCS 4377.
30. I. Teranishi, T. Oyama, and W. Ogata. General conversion for obtaining strongly existentially unforgeable signatures. In Proc. Progress in Cryptology - INDOCRYPT 2006, pages 191205. Springer-Verlag, 2006. LNCS 4329.