A new signature scheme without random oracles

International Journal of Security and Networks

Volumn 1, Issue 3-4, 2006, Pages 237-242

  How Tan, Chik ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

cryptography; factorisation; signature; strong RSA

Indexed keywords

EID: 77954644745     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. Bellare, M. and Rogaway, P. (1993) ‘Random oracles are practical: a paradigm for designing efficient protocols’, Proceedings of the First ACM Conference on Computer and Communications Security (CCS’93), Fairfax, VR, pp.62–73.
2. Boneh, D. and Boyen, X. (2004) ‘Short signatures without random oracles’, Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt’04), Interlaken, Switzerland, pp.56–73.
3. Boneh, D., Mironov, I. and Shoup, V. (2003) ‘A secure signature scheme from bilinear map’, Proceedings of Topics in Cryptology - CT-RSA’03, San Francisco, CA, pp.98–110.
4. Camenisch, J. and Lysyanskaya, A. (2003) ‘A signature scheme with efficient protocols’, Proceedings of Third Conference on Security in Communication Networks -SCN’02, Amalfi, Italy, pp.274–295.
5. Canetti, R., Golderich, O. and Halevi, S. (1998) ‘The random oracle methodology, revisited’, Proceedings of 30th Annual ACM Symposium on Theory of Computing - STOC’98, Dallas, TX, pp.209–218.
6. Coron, J-S. and Naccache, D. (2000) ‘Security analysis of the Gennaro-Halevi-Rabin signature scheme’, Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt’00), Bruges, Belgium, pp.91–101.
7. Cramer, R. and Shoup, V. (1999) ‘Signature schemes based on the strong RSA assumption’, Proceedings of the Sixth ACM Conference on Computer and Communications Security, Singapore, pp.46–52.
8. Cramer, R. and Shoup, V. (2000) ‘Signature schemes based on the strong RSA assumption’, ACM Transaction on Information and System Security, Vol. 3, No. 3, pp.161–185.
9. Cramer, R. and Shoup, V. (2003) ‘Design and analysis of practical public-key encryption schemes secure adaptive chosen ciphertext attack’, SIAM Journal of Computing, Vol. 33, No. 1, pp.167–226.
10. Delfs, H. and Knebl, H. (2002) Introduction to Cryptography, Springer-Verlag.
11. Dent, A.W. (2002) ‘Adapting the weaknesses in the random oracle model in the generic group model’, Proceedings of Advances in Cryptology - Asiacrypt 2002, Queenstown, New Zealand, pp.100–109.
12. ElGamal, T. (1985) ‘A public key cryptosystem and a signature scheme based on discrete logarithms’, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp.469–472.
13. Fischlin, M. (2000) ‘A note on security proofs in the generic model’, Proceedings of Advances in Cryptology - Asiacrypt 2000, Kyoto, Japan, pp.458–469.
14. Fischlin, M. (2003) ‘The Cramer-Shoup strong-RSA signature scheme revisited’, Proceedings of Workshop in Public Key Cryptography - PKC 2003, Miami, FL, pp.116–129.
15. Gennaro, R., Halevi, S. and Rabin, T. (1999) ‘Secure hash-and-sign signature without the random oracle’, Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt’99), Prague, Czech Republic, pp.123–139.
16. Goldwasser, S., Micali, S. and Rivest, R.L. (1988) ‘A digital signature scheme secure against adaptive chosen-message attacks’, SIAM Journal of Computing, Vol. 17, No. 2, pp.281–308.
17. Menezes, A. and Smart, N. (2004) ‘Security of signature schemes in a multi-user setting’, Designs, Codes and Cryptography, Vol. 33, No. 3, pp.261–274.
18. Müller, S. (2001) ‘A probable prime test with very high confidence for n = 1 mod 4’, Proceedings of Advances in Cryptology - Asiacrypt’01, Gold Coast, Australia, pp.87–106.
19. Müller, S. (2003) ‘A probable prime test with very high confidence for n = 3 mod 4’, Journal of Cryptology, Vol. 16, No. 2, pp.117–139.
20. Rivest, R.L., Shamir, A. and Adleman, L. (1978) ‘A method for obtaining digital signatures and public key cryptosystems’, Communications of the ACM, Vol. 21, pp.120–126.
21. Schnorr, C.P. (1991) ‘Efficient signature generation for smart cards’, Journal of Cryptology, Vol. 4, No. 3, pp.161–174.
22. Schnorr, C.P. and Jakobsson, M. (1999) ‘Security of discrete log cryptosystems in the random oracle + generic model’, Proceedings of Conference on The Mathematics of Public-Key Cryptography, The Fields Institute, Toronto, Canada.
23. Shoup, V. (1997) ‘Lower bounds for discrete logarithms and related problems’, Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt’97), Konstanz, Germany, pp.256–266.
24. Tan, C.H. (2004) ‘Key substitution attacks on someprovably secure signature schemes’, IEICE Transactions on Fundamentals of Electronic, Communications and Computer Sciences, Vol. E87-A, No. 1, pp.226–227.
25. Tan, C.H. (2005) ‘Key substit ution attacks on provably secure short signature schemes’, IEICE Transaction on Fundamentals of Electronic, Communications and Computer Sciences, Vol. E88-A, No. 2, pp.611–612.
26. Tan, C.H. (2006) ‘A secure signature scheme’, Proceedings of International Wireless Communications and Mobile Computing Conference 2006 (IWCMC 2006), Vancouver, Canada, pp.195–199.
27. Tan, C.H., Yi, X. and Siew, C.K. (2003) ‘A new provably secure signature scheme’, IEICE Transactions on Fundamentals of Electronic, Communications and Computer Sciences, Vol. E86-A, No. 10, pp.2633–2635.
28. Wei, V.K. and Yuen, T. (2005) ‘More short signatures without random oracles’, manuscript, Available at: http://eprint.iacr.org/2005/463.
29. Yan, S.Y. (2000) Number Theory for Computing, Springer-Verlag.
30. Zhang, F., Chen, X., Susilo, W. and Mu, Y. (2005) ‘A new short signature scheme without random oracles from bilinear pairings’, manuscript, Available at: http://eprint.iacr. org/2005/386.
31. This paper is extended conference paper presented in the Computer and Network Security Symposium of the 2006 International Wireless Communication and Mobile Computing Conference.
32. This paper is extended conference paper presented in the Computer and Network Security Symposium of the 2006 International Wireless Communication and Mobile Computing Conference.
33. H is a subfunction of H with key be defined by N, X, g.
34. The other way just checks whether e is prime, but it is more time consuming.
35. This could be sped up by using multi-exponentiation.
36. In general, l is chosen such that 3l ^ n. Then, the complexity of the primality test is less than that of eth root.