Some constructions and bounds for authentication codes
Douglas R. Stinson
- Vol. 1, Iss: 1, pp 418-425
Reads0
Chats0
TLDR
In this article, the authors review and generalize bounds on the probability that an opponent can deceive the transmitter/receiver by means of impersonation or substitution, and give several constructions for authentication codes that meet one or more of these bounds with equality.Abstract:
We investigate authentication codes, using the model described by Simmons. We review and generalize bounds on the probability that an opponent can deceive the transmitter/receiver by means of impersonation or substitution. Also, we give several constructions for authentication codes that meet one or more of these bounds with equality. These constructions use combinatorial designs, such as transversal designs, group-divisible designs, and BIBDs (balanced incomplete block designs).read more
Citations
More filters
Journal ArticleDOI
Universal hashing and authentication codes
TL;DR: The application of universal hashing to the construction of unconditionally secure authentication codes without secrecy is studied and some new classes of hash functions are defined and some general constructions for these classes are given.
Journal ArticleDOI
A survey of information authentication
TL;DR: The general principles that underlie all authentication schemes are reviewed and illustrated using the examples of an early telegraphy cable code, a US military authentication protocol, and authentication of electronic funds transfers in the US Federal Reserve System.
Journal ArticleDOI
Authentication theory and hypothesis testing
TL;DR: By interpreting message authentication as a hypothesis testing problem, this paper provides a generalized treatment of information-theoretic lower bounds on an opponent's probability of cheating in one-way message authentication.
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.
Book
advances-in-cryptology-eurocrypt-87
TL;DR: The frequency of a l l short p a t t e r n s as w e l l as the au tocor re l a t ions tu rn ou t t o be ideal means that sequences generated by t h e ASG is provably secure against t he standard at tacks.
References
More filters
Journal ArticleDOI
Codes which detect deception
TL;DR: If the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1, and several encoding functions Φ(.,.) are given, some of which achieve this bound.
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.
Book
Advances in Cryptology: Proceedings of Crypto 84
TL;DR: Some Public-Key Crypto-Functions as Intractable as Factorization as well as Cryptosystems and Other Hard Problems.
Book ChapterDOI
On Transversal Designs
TL;DR: A design is a pair (X,B) where X is a finite set of points and B is a family of not necessarily distinct- subsets Bi (called blocks) of X.