Journal ArticleDOI
The Combinatorics of Perfect Authentication Schemes
Reads0
Chats0
TLDR
The purpose of this paper is to prove the equivalence of perfect authentication schemes and maximum distance separable codes.Abstract:
The purpose of this paper is to prove the equivalence of perfect authentication schemes and maximum distance separable codes.read more
Citations
More filters
Journal ArticleDOI
A Generic Construction of Cartesian Authentication Codes
TL;DR: The authentication codes presented in this paper are better than known ones with comparable parameters and it is demonstrated that the construction is related to certain combinatorial designs, such as difference matrices and generalized Hadamard matrices.
Journal ArticleDOI
Combinatorial Characterizations of Authentication Codes II
Rolf S. Rees,Douglas R. Stinson +1 more
TL;DR: An infinite class of extremal codes, in which the source states are not equiprobable, derived from affine planes is presented, and several properties that an extremal code must satisfy are derived.
Journal ArticleDOI
A lower bound on authentication after having observed a sequence of messages
TL;DR: A lower bound is proved on the probability that a spoofer observing i messages succeeds in generating an authentic message without knowing the encoding rule used, based on the conditional entropy of the encoding rules when a sequence of messages is known.
Journal ArticleDOI
On the Composition of Matroids and Ideal Secret Sharing Schemes
Siaw-Lynn Ng,Michael Walker +1 more
TL;DR: A necessary condition on the types of subsets that are allowed in an ideal access structure as well as an upper bound on the number of such access structures are obtained.
Journal ArticleDOI
Bounds and Characterizations of Authentication/SecrecySchemes
TL;DR: This work considers authentication/secrecy schemes from the information theoretic approach and extends results on unconditionally secure authentication schemes and then considers unconditionallySecure authentication schemes that offer perfect L-fold secrecy.
References
More filters
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Book ChapterDOI
Authentication theory/coding theory
TL;DR: This work considers a communications scenario in which a transmitter attempts to inform a remote receiver of the state of a source by sending messages through an imperfect communications channel, and considers the deliberate introduction of redundant information into the transmitted message.
Journal ArticleDOI
The combinatorics of authentication and secrecy codes
TL;DR: Borders are obtained on the number of encoding rules required in order to obtain maximum levels of security in unconditionally secure secrecy and authentication codes.
Journal ArticleDOI
Information-theoretic bounds for authentication schemes
TL;DR: A lower bound is derived for the average PN of the probabilities P(0), P(1),...;, P(N) in terms of the entropy of the space of encoding rules, and to derive necessary and sufficient conditions which the encoding scheme must satisfy in order to ensure that this bound cannot be exceeded.
Book ChapterDOI
Cartesian authentication schemes
TL;DR: It is shown that their existence is equivalent to the existence of nets and constructions of new authentication schemes derived from generalised n-gons which take on the lowest combinatorial bound for the impersonation attack are presented.