Security notions for unconditionally secure signature schemes

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

Volumn 2332, Issue , 2002, Pages 434-449

  Shikata, Junji ^a   Hanaoka, Goichiro ^a   Zheng, Yuliang ^b   Imai, Hideki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

^b UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

CHOSEN MESSAGE ATTACKS; COMPUTATIONAL ASSUMPTIONS; CONSTRUCTION METHOD; DIGITAL SIGNATURE SCHEMES; PUBLIC-KEY SIGNATURES; STRONG SECURITIES; UNCONDITIONAL SECURITY; UNCONDITIONALLY SECURE;

AUTHENTICATION;

EID: 84947210346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_29     Document Type: Conference Paper

References (31)

1. M. Abe and T. Okamoto, “A signature scheme with message recovery as secure as discrete logarithm”, Advances in Cryptology – ASIACRYPT ’99, LNCS 1716, pp. 378–389, Springer, 1999.
2. M. Bellare and P. Rogaway, “The exact security of digital signatures – How to sign with RSA and Rabin”, Advances in Cryptology – EUROCRYPT ’96, LNCS 1070, Springer, 1996.
3. E. F. Brickell and D. R. Stinson, “Authentication codes with multiple arbiters,” Advances in Cryptology – EUROCRYPT ’88, LNCS 330, Springer, pp. 51–55, 1988.
4. D. Chaum and H. van Antwerpen, “Undeniable signatures”, Advances in Cryptology – CRYPTO ’89, Springer, pp. 212–216, 1990.
5. D. Chaum and S. Roijakkers, “Unconditionally secure digital signatures,” Advances in Cryptology – CRYPTO’90, LNCS 537, Springer, pp. 206–215, 1990.
6. D. Chaum, E. Heijst and B. Pfitzmann, “Cryptographically strong undeniable signatures, unconditionally secure for the signer,” Advances in Cryptology –CRYPTO ’91, LNCS 576, Springer, pp. 470–484, 1991.
7. R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption”, Proc. of the 6th ACM Conference in Computer and Communication Security, 1999.
8. Y. Desmedt and M. Yung, “Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attack,” Advances in Cryptology –CRYPTO ’90, LNCS 537, Springer, pp. 177–188, 1990.
9. Y. Desmedt, Y. Frankel and M. Yung, “Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback,” Proc. of IEEE Infocom’92, pp. 2045–2054, 1992.
10. W. Diffie and M. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory 22, 6, pp. 644–654, 1976.
11. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, 31, 4, pp. 469–472, 1985.
12. R. Gennaro, S. Halevi, and T. Rabin “Secure hash-and-sign signatures without the random oracle”, Advances in Cryptology – EUROCRYPT ’99, LNCS 1592, pp. 123–139, Springer, 1999.
13. E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, “Codes which detect deception,” Bell System Technical Journal, 53, pp. 405–425, 1974.
14. S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen message attacks”, SIAM J. Comput. 17, 2, pp. 281–308, 1988.
15. G. Hanaoka, J. Shikata, Y. Zheng, and H. Imai, “Unconditionally secure digital signature schemes admitting transferability”, Advances in Cryptology – ASIACRYPT 2000, LNCS 1976, Springer, pp. 130–142, 2000.
16. G. Hanaoka, J. Shikata, Y. Zheng, and H. Imai, “Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code”, to appear in Proc. of Public Key Cryptography, Springer, 2002.
17. T. Johansson, “Lower bounds on the probability of deception in authentication with arbitration”, IEEE Trans. Inform. Theory 40, 5, pp. 1573–1585, 1994.
18. T. Johansson, “Further results on asymmetric authentication schemes,” Information and Computation, 151, pp. 100–133, 1999.
19. K. Kurosawa, “New bound on authentication code with arbitration,” Advances in Cryptology – CRYPTO ’94, LNCS 839, Springer, pp. 140–149, 1994.
20. K. Kurosawa and S. Obana, “Combinatorial bounds for authentication codes with arbitration,” Advances in Cryptology – EUROCRYPT ’95, LNCS 921, Springer, pp. 289–300, 1995.
21. R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signature and public-key cryptosystems,” Communication of the ACM, vol.21, no.2, pp. 120–126, 1978.
22. B. Pfitzmann, “Sorting out signature schemes”, Proc. of the First ACM Conference on Computer and Communications Security, ACM Press, pp. 74–86, 1993.
23. D. Pointcheval and J. Stern, “Security proofs for signature schemes”, Advances in Cryptology – EUROCRYPT ’96, LNCS 1070, Springer, 1996.
24. R. Safavi-Naini and H. Wang, “New results on multi-receiver authentication codes,” Advances in Cryptology – EUROCRYPT ’98, LNCS 1403, pp. 527–541, Springer, 1998.
25. R. Safavi-Naini and H. Wang, “Broadcast authentication in group communication,” Advances in Cryptology – ASIACRYPT ’99, LNCS 1716, Springer, pp. 399–411, 1999.
26. R. Safavi-Naini and H. Wang, “Multireceiver authentication codes: models, bounds, constructions and extensions,” Information and Computation, 151, pp. 148–172, 1999.
27. G. J. Simmons, “Authentication theory/coding theory,” Advances in Cryptology – CRYPTO ’84, LNCS 196, Springer, pp. 411–431, 1984.
28. G. J. Simmons, “Message authentication with arbitration of transmitter/receiver disputes,” Advances in Cryptology – EUROCRYPT ’87, Springer, pp. 151–165, 1987.
29. G. J. Simmons, “A Cartesian construction for unconditionally secure authentication codes that permit arbitration,” Journal of Cryptology 2, pp. 77–104, 1990.
30. R. Taylor, “Near optimal unconditionally secure authentication,” Advances in Cryptology – EUROCRYPT ’94, LNCS 950, Springer, pp. 244–253, 1994.
31. Y. Wang and R. Safavi-Naini, “A3-codes under collusion attacks” Advances in Cryptology – ASIACRYPT ’99, LNCS 1716, Springer, pp. 390–398, 1999.