๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial characterizations of authentication codes

โœ Scribed by D. R. Stinson

Publisher
Springer
Year
1992
Tongue
English
Weight
536 KB
Volume
2
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs. In both of these characterizations, it turns out that encoding roles must be equiprobable; in the second characteriztion, the source states must also be equiprobable.

๐Ÿ“œ SIMILAR VOLUMES

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
โœ Dingyi Pei ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 433 KB ๐Ÿ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

New combinatorial designs and their appl
New combinatorial designs and their applications to authentication codes and secret sharing schemes
โœ Wakaha Ogata; Kaoru Kurosawa; Douglas R. Stinson; Hajime Saido ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

This paper introduces three new types of combinatorial designs, which we call external difference families (EDF), external BIBDs (EBIBD) and splitting BIBDs. An EDF is a special type of EBIBD, so existence of an EDF implies existence of an EBIBD. We construct optimal splitting A-codes by using EDF.

Construction of Cartesian authentication
Construction of Cartesian authentication codes from unitary geometry
โœ Zhe-Xian Wan ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 886 KB

In the present paper several constructions of Cartesian authentication codes from unitary geometry over finite fields are presented and their size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities Pt and Ps of a su