Efficient and unconditionally secure digital signatures and a security analysis of a multireceiver authentication code

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

Volumn 2274, Issue , 2002, Pages 64-79

  Hanaoka, Goichiro ^a   Shikata, Junji ^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

CODES (SYMBOLS); COMPUTATION THEORY; CRYPTOGRAPHY; DIGITAL STORAGE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

COMPUTATIONAL ASSUMPTIONS; DIGITAL SIGNATURE SCHEMES; LONG-TERM INTEGRITY; MEMORY REQUIREMENTS; MULTI-RECEIVER AUTHENTICATION CODES; SECRET INFORMATION; SECURITY ANALYSIS; UNCONDITIONALLY SECURE;

AUTHENTICATION;

EID: 84958954335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_5     Document Type: Conference Paper

References (19)

1. D. Boneh and R. J. Lipton, “Quantum cryptanalysis of hidden linear functions,” Proc. of CRYPTO’95, LNCS 963, Springer-Verlag, pp.424-437, 1995.
2. E. F. Brickell and D. R. Stinson, “Authentication codes with multiple arbiters,” Proc. of Eurocrypt’88, LNCS 330, Springer-Verlag, pp.51-55, 1988.
3. S. Cavallar, B. Dodson, A. K. Lenstra, et al., “Factorization of a 512-bit RSA modulus,” Proc. of Eurocrypt’00, LNCS 1807, Springer-Verlag, pp.1-18, 2000.
4. D. Chaum and S. Roijakkers, “Unconditionally secure digital signatures,” Proc. Of CRYPTO’90, LNCS 537, Springer-Verlag, pp.206-215, 1990.
5. Y. Desmedt and M. Yung, “Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attack,” Proc. of CRYPTO’90, LNCS 537, Springer-Verlag, pp.177-188, 1990.
6. 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.
7. E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, “Codes which detect deception,” Bell System Technical Journal, 53, pp.405-425, 1974.
8. T. Johansson, “Further results on asymmetric authentication schemes,” Information and Computation, 151, pp.100-133, 1999.
9. G. Hanaoka, J. Shikata, Y. Zheng and H. Imai, “Unconditionally secure digital signature schemes admitting transferability,” Proc. of Asiacrypt2000, LNCS 1976, Springer-Verlag, pp.130-142, 2000.
10. K. Kurosawa, “New bound on authentication code with arbitration,” Proc. Of CRYPTO’94, LNCS 839, Springer-Verlag, pp.140-149, 1994.
11. B. Pfitzmann and M. Waidner “Fail-stop signatures and their application,” Proc. Of Securicom 91, 9thWorldwide Congress on Computer and Communications Security and Protection, pp.145-160, 1991.
12. T. P. Pedersen and B. Pfitzmann, “Fail-stop signatures,” SIAM J. on Comp., 26, no.2, pp.291-330, 1997.
13. R. Safavi-Naini and H. Wang, “New results on multi-receiver authentication codes,” Proc. of Eurocrypt’98, LNCS 1403, pp.527-541, 1998.
14. R. Safavi-Naini and H. Wang, “Broadcast authentication in group communication,” Proc. of Asiacrypt’99, LNCS 1716, Springer-Verlag, pp.399-411, 1999.
15. R. Safavi-Naini and H. Wang, “Multireceiver authentication codes: models, bounds, constructions and extensions,” Information and Computation, 151, pp.148-172, 1999.
16. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comp., 26, no.5, pp.1484-1509, 1997.
17. G. J. Simmons, “Authentication theory/coding theory,” Proc. of CRYPTO’84, LNCS 196, Springer-Verlag, pp.411-431, 1984.
18. G. J. Simmons, “Message authentication with arbitration of transmitter/receiver disputes,” Proc. of Eurocrypt’87, Springer-Verlag, pp.151-165, 1987.
19. G. J. Simmons, “A Cartesian construction for unconditionally secure authentication codes that permit arbitration,” Journal of Cryptology, 2, pp.77-104, 1990.