A unified and generalized treatment of authentication theory

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

Volumn 1046, Issue , 1996, Pages 387-398

  Maurer, Ueli M ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Cryptography; Information theory; Unconditionally secure authentication

Indexed keywords

AUTHENTICATION; INFORMATION THEORY;

INFORMATION-THEORETIC LOWER BOUNDS; MESSAGE AUTHENTICATION; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 84938858421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_32     Document Type: Conference Paper

References (17)

1. R. E. Blahut, Principles and practice of information theory, Addison-Wesley, 1987.
2. E.F. Brickell, A few results in message authentication, Congressus Numerantium, vol. 43, pp. 141-154, 1984.
3. V. Fåk, Repeated use of codes which detect deception, IEEE Drans. on Information Theory, Vol. 25, No. 2, 1979, pp. 233-234.
4. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell Syst. Tech. J., Vol. 53, No. 3, 1974, pp. 405-424.
5. R. Johannesson and A. Sgarro, Strengthening Simmons' bound on impersonation, IEEE Trans, on Information Theory, Vol. 37, No. 4, 1991, pp. 1182-1185.
6. T. Johansson, Lower bounds on the probability of deception in authentication with arbitration, IEEE Trans, on Information Theory, Vol. 40, No. 5, 1994, pp. 1573-1585.
7. J.L. Massey, Contemporary cryptology-an Introduction, in Contemporary cryptology-the science of information integrity, G.J. Simmons (Ed.), IEEE Press, 1992.
8. R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, Vol. 21, No. 2, 1978, pp. 120-126.
9. U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, J. of Cryptology, Vol. 6, No. 3, 1993, pp. 135-156.
10. A. Sgarro, Information divergence bounds for authentication codes, Advances in Cryptology-Eurocrypt '89, J.-J. Quisquater and J. Vandewalle (Eds.), Lecture Notes in Computer Science, No. 434. Berlin: Springer Verlag, 1985, pp. 93-101.
11. C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, Oct. 1949, pp. 656-715.
12. G. J. Simmons, Authentication theory/coding theory, in Advances in Cryptology-CRYPTO 84, G.R. Blakley and D. Chaum (Eds.), Lecture Notes in Computer Science, No. 196, Berlin: Springer Verlag, 1985, pp. 411-431.
13. G.J. Simmons and B. Smeets, A paradoxical result in unconditionally secure authentication codes-and an explanation, in Cryptography and Coding II, C. Mitchell, Ed., Oxford: Clarendon, 1992, pp. 231-258.
14. B. Smeets, Bounds on the Probability of Deception in Multiple Authentication, IEEE Trans, on Information Theory, Vol. 40, No. 5, 1994, pp. 1586-1591.
15. B. Smeets, P. Vanroose, and Zhe-Xian Wan, On the construction of authentication codes with secrecy and codes which stand against spoofing attacks of order L > 2, Advances in Cryptology-Eurocrypt '90, I.B. Damgård, Ed., Lecture Notes in Computer Science, No. 473, Berlin: Springer Verlag, 1991, pp.306-312.
16. D. R. Stinson, Some constructions and bounds for authentication codes, J. of Cryptology, Vol. 1, No. 1, 1988, pp 37-51.
17. M. Walker, Information-theoretic bounds for authentication schemes, J. of Cryptology, Vol 2, No. 3, 1990, pp. 131-143.