A construction for authentication/secrecy codes from certain combinatorial designs
If we agree to use one of v possible messages to communicate one of k possible source states, then an opponent can successfully impersonate a transmitter with probability at least k/v, and can successfully substitute a message with a fraudulent one with probability at last (k- 1)/(v-1). We wish to limit an opponent to these bounds. In addition, we desire that the observation of any two messages in the communication channel will give an opponent no clue as to the two source states. We describe a construction for a code which achieves these goals, and which does so with the minimum possible number of encoding rules (namely, \(v\cdot (v-1)/2)\). The construction uses a structure from combinatorial design theory known as a perpendicular array.
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Communication Theory of Secrecy Systems*
- Ein elementarer und konstruktiver Beweis für die Zerlegungsgleichheit der Hill'schen Tetraeder mit einem Quader. (An elementary and constructive proof for the equivalence by dissection of the Hill tetrahedra with a rectangular parallelepipedon)
- scientific article; zbMATH DE number 4019075 (Why is no real title available?)
- scientific article; zbMATH DE number 3887703 (Why is no real title available?)
- scientific article; zbMATH DE number 3856985 (Why is no real title available?)
- scientific article; zbMATH DE number 4210147 (Why is no real title available?)
- scientific article; zbMATH DE number 3715579 (Why is no real title available?)
- scientific article; zbMATH DE number 3893245 (Why is no real title available?)
- scientific article; zbMATH DE number 3895109 (Why is no real title available?)
- On Partially Resolvable t–Partitions
- Some constructions and bounds for authentication codes
- Steiner pentagon systems
- Some constructions and bounds for authentication codes
- On complementary decompositions of the complete graph
- New bounds and constructions for authentication/secrecy codes with splitting
- Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Three constructions of authentication/secrecy codes
- On the construction of authentication and secrecy codes
- Mosaics of combinatorial designs for information-theoretic security
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- A class of authentication codes with secrecy
- The power of primes: security of authentication based on a universal hash-function family
- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- scientific article; zbMATH DE number 4045632 (Why is no real title available?)
- scientific article; zbMATH DE number 4057437 (Why is no real title available?)
- scientific article; zbMATH DE number 1024097 (Why is no real title available?)
- scientific article; zbMATH DE number 975409 (Why is no real title available?)
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- New bound for affine resolvable designs and its application to authentication codes
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- The combinatorics of authentication and secrecy codes
- Information-theoretic bounds for authentication schemes
This page was built for publication: A construction for authentication/secrecy codes from certain combinatorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112007)
