Skip to main content
Conference ProceedingsOPEN ACCESS

Information-theoretic bounds for authentication frauds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 658 LNCS 467-471
DOI: 10.1007/3-540-47555-9_41
1Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Several properties of authentication codes depend on a mathematical structure, called below a fraud scheme, which is much simpler than the one originally given. Relying on this fact, we present a powerful lower bound, which is a sort of mould to painlessly derive a whole range of information-theoretic bounds to fraud probabilities in authentication coding.

Author supplied keywords

Cite

CITATION STYLE

APA

Sgarro, A. (1993). Information-theoretic bounds for authentication frauds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 467–471). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free