General conversion for obtaining strongly existentially unforgeable signatures

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 1, 2008, Pages 94-106

  Teranishi, Isamu ^a,b   Oyama, Takuro ^b   Ogata, Wakaha ^b  

^a NEC CORPORATION   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Chameleon commitment; Chosen message security; Signature scheme; Standard model; Strong unforgeability

Indexed keywords

NETWORK SECURITY;

CHAMELEON COMMITMENT; MESSAGE SECURITIES; SIGNATURE SCHEME; STANDARD MODEL; STRONG UNFORGEABILITY;

AUTHENTICATION;

EID: 45849109465     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.1.94     Document Type: Article

References (26)

1. J.H. An, Y. Dodis, and T. Rabin, "On the security of joint signature and encryption," Eurocrypt 2002, pp.83-107, 2002.
2. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," ACM Conference on Computer and Communications Security 1993, pp.62-73, 1993.
3. I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic Curve in Cryptography, Cambridge University Press, 1999.
4. D. Boneh, X. Boyen, and H. Shacham, "Short group signatures," Crypto 2004, pp.41-55, 2004.
5. D. Boneh, E. Shen, and B. Waters, "Strongly unforgeable signatures based on computational Diffie-Hellman," PKC 2006, pp.229-240, 2006.
6. R. Canetti, S. Halevi, and J. Katz, "Chosen-ciphertext security from identity-based encryption," Eurocrypt 2004, pp.229-235. 2004.
7. J. Camenisch and A. Lysyanskaya, "A signature scheme with efficient protocols." SCN 2002, pp.268-289, 2002.
8. S. Contini, A.K. Lenstra. and R. Steinfield, "VSH, an efficient and provable collision-resistant hash function," Eurocrypt 2006. pp.) 65-182, 2006.
9. I. Darngård. "Towards practical public key systems secure against chosen ciphertext attacks," CRYPTO'91, pp.445-456, 1991.
10. D. DoJev, C. Dwork, and M. Naor. "Non-malleable cryptography," SIAM J. Comput., vol.30, no.2, pp.391 437, 2000.
11. S. Goldwasser, S. Micali, and R.L. Rivest, "A digital signature scheme secure against adaptivechosen-message attacks," SIAM J. Comput., vol.17. no.2. pp.281-308. 1988.
12. O. Goldreich, Foundations or Cryptography, Vol.1 Basic Tools, Cambridge University Press, 2001.
13. H. Krawczyk and T. Rabin. "Chameleon hashing and signatures," 1997. http://ibm.com/security/chameleon.ps, http://eprint.iacr.Qrg/1998/010
14. H. Krawczyk and T. Rabin, "Chameleon signatures," NDSS 2000, pp.143- 154, 2000.
15. A J. Menezes, P.C. van Oorschot. and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 199ft.
16. T.P. Pedersen, "A threshold cryptosystem without a misted party (extended abstract)." EUROCRYPT'91, pp.522-526. Springer-Veriag, 1991.
17. P. Paillier and D. Vergnaud, "Discrete-log-based signatures may not be equivalent to discrete log," Asiacrypt 2005, pp.1-20, 2005.
18. C. Rackoff and D.R. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen eiphertext attack," CRYPTO'91, pp.433-444, 1991.
19. J. Rompel, "One-way functions are necessary and sufficient for secure signatures," STOC 1990. pp.387-394. 1990.
20. T. Okamoto, "Efficient blind and partially blind signatures without random oracles," TCC 2006, pp.80-99, 2006.
21. A. Shamir and Y. Tauman. "Improved online/offline signature schemes," Crypto 2001, pp.355-367, 2001.
22. V. Stoup, "Lower bound for discrete logarithms and related problems," Eurocrypt'97. pp.256-266. 1997.
23. R. Steinfeld, J. Pieprzyk, and H. Wang, "How to strengthen any weakly unforgeable signature into a strongly unforgeable signature" CT-RSA, 2007.
24. Extended Abstract Version of this paper, Indocrypt 2006, pp.191-205, 2006.
25. B. Waters, "Efficient identity-based encryption without random oracles," Eurocrypt 2005, pp.114-127, 2005.
26. R. Zhang, "Tweaking TBE/1BE to PKE transforms with chameleon hash functions," ACNS'07, Full version is available at http://staff.aist.go.jp/ r-zhang/research/papers.html#CCATBE