Open Access10.3929/ETHZ-A-006001383
Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy
Michael Huber
- 01 Jan 2010
3
TL;DR: This work establishes a construction of optimal authentication codes achieving perfect multi-fold secrecy by means of combinatorial designs and presents the first infinite class of optimal codes that provide two-fold security against spoofing attacks and at the same time perfect two- fold secrecy.
read more
Abstract: We establish a construction of optimal authentication codes achieving perfect multi-fold secrecy by means of combinatorial designs. This continues the author’s work (ISIT 2009, cf. [1]) and answers an open question posed therein. As an application, we present the first infinite class of optimal codes that provide two-fold security against spoofing attacks and at the same time perfect two-fold secrecy.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Combinatorial Designs for Authentication and Secrecy Codes
Michael Huber
- 27 May 2010
TL;DR: This monograph brings together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes of combinatorial designs.
22
Perfect Secrecy Systems Immune to Spoofing Attacks
TL;DR: Novel perfect secrecy systems that provide immunity to spoofing attacks under equiprobable source probability distributions are presented and a recently extended authentication model where the opponent has access to a verification oracle is applied.
Perfect secrecy systems immune to spoofing attacks
TL;DR: In this article, the authors presented novel perfect secrecy systems that provide immunity to spoofing attacks under equiprobable source probability distributions, relying on an existence result for t-designs by Teirlinck, constructively generate systems that can reach an arbitrary high level of security.
1
References
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
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.
421
Authentication theory/coding theory
Gustavus J. Simmons
- 23 Aug 1985
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.
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.
Steiner quadruple systems - a survey
TL;DR: A Steiner system S( t, k, O) is a pair (S, B) where S is a u-set and B is a collection of k-subsets of S such that every t-subset of S is contained in exactly one member of B.
125