Authentication theory and hypothesis testing

IEEE Transactions on Information Theory

Volumn 46, Issue 4, 2000, Pages 1350-1356

  Maurer, Ueli M ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; DECODING; ENCODING (SYMBOLS); ERRORS; INFORMATION THEORY; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

HYPOTHESIS TESTING; IMPERSONATION ATTACK; MESSAGE AUTHENTICATION; SUBSTITUTION ATTACK; UNCONDITIONAL SECURITY;

SECURITY OF DATA;

EID: 0034228863     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.850674     Document Type: Article

References (21)

1. R.E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
2. E. F. Brickell, A few results in message authentication, in Congr. Numerantium, 1984, vol. 43, pp. 141-154.
3. V. Fåk, Repeated use of codes which detect deception, IEEE Trans. Inform. Theory, vol. IT-25, pp. 233-234, Mar. 1979.
4. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, Codes which detect deception, Bell Syst. Tech. J., vol. 53, no. 3, pp. 405-424, 1974.
5. R. Johannesson and A. Sgarro, Strengthening Simmons' bound on impersonation, IEEE Trans. Inform. Theory, vol. 37, pp. 1182-1185, July 1991.
6. T. Johansson, Eower bounds on the probability of deception in authentication with arbitration, IEEE Trans. Inform. Theory, vol. 40, pp. 1573-1585, Sept. 1994.
7. J. E. Massey, Contemporary cryptology - An introduction, in Contemporary Cryptology - The Science of Information Integrity, G. J. Simmons, Ed. Piscataway, NJ: IEEE Press, 1992.
8. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Trans. Inform. Theory, vol. 39, pp. 733-742, May 1993.
9. R. E. Rivest, A. Shamir, and E. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, vol. 21, no. 2, pp. 120-126, 1978.
10. U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, J. Cryptol., vol. 6, no. 3, pp. 135-156, 1993.
11. A. Sgarro, Information divergence bounds for authentication codes, in Advances in Cryptology - Eurocrypt '89 (Lecture Notes in Computer Science), J.-J. Quisquater and J. Vandewalle, Eds. Berlin, Germany: Springer-Verlag, 1985, pp. 93-101.
12. _, Advances in Cryptology - Eurocrypt '92 (Lecture Notes in Computer Science), R. A. Rueppel, Ed. Berlin, Germany: Springer-Verlag, 1992, pp. 467-471.
13. _, Information-theoretic bounds for authentication frauds, J. Comput. Security, vol. 2, no. 1, pp. 53-63, 1993.
14. _, Blind coding: Authentication frauds from the point of view of rate-distortion theory, presented at the Workshop on Coding and Cryptography, Paris, Jan. 1999.
15. C. E. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J., vol. 28, pp. 656-715, Oct. 1949.
16. G. J. Simmons, Authentication theory/coding theory, in Advances in Cryptology - CRYPTO 84 (Lecture Notes in Computer Science), G. R. Blakley and D. Chaum, Eds. Berlin, Germany: Springer-Verlag, 1985, pp. 411-431.
17. 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, U.K.: Clarendon, 1992, pp. 231-258.
18. B. Smeets, Bounds on the probability of deception in multiple authentication, IEEE Trans. Inform. Theory, vol. 40, pp. 1586-1591, Sept. 1994.
19. B. Smeets, P. Vanroose, and Z.-X. Wan, On the construction of authentication codes with secrecy and codes which stand against spoofing attacks of order L ≥ 2, in Advances in Cryptology - Eurocrypt '90 (Lecture Notes in Computer Science), I. B. Damgård, Ed. Berlin, Germany: Springer-Verlag, 1991, pp. 306-312.
20. D. R. Stinson, Some constructions and bounds for authentication codes, J. Cryptol, vol. 1, no. 1, pp. 37-51, 1988.
21. M. Walker, Information-theoretic bounds for authentication schemes, J. Cryptol., vol. 2, no. 3, pp. 131-143, 1990.