New bounds and constructions for authentication/secrecy codes with splitting
The article deals with the problem of communicating certain information to a receiver in such a way as to minimize an opponent's success to mislead the receiver by sending a fraudulent message to the receiver hoping to have it accepted as authentic. Using the mathematical authentication model introduced e.g. in \textit{G. J. Simmons} [Lect. Notes in Comp. Sci. 196, 411-432 (1985; Zbl 0575.94011 )] authentication codes with splitting are investigated. First, bounds for the probability that the opponent can deceive the receiver are given for the variety of cases where the opponent is assumed to observe a certain number of messages before sending his fraudulent message. Then the construction of authentication codes which meet one or more of these bounds is presented. In all cases considered the codes are unconditionally secure, i.e. it is assumed that any opponent has unlimited computational resources.
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- A characterization of the partial geometry \(T^ *_ 2(K)\)
- A construction for authentication/secrecy codes from certain combinatorial designs
- Affine resolvable balanced incomplete block designs: a survey
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Communication Theory of Secrecy Systems*
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3856985 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 4070794 (Why is no real title available?)
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3893212 (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?)
- Optimal authentication systems and combinatorial designs
- Some constructions and bounds for authentication codes
- Strongly regular graphs, partial geometries and partially balanced designs
- The combinatorics of authentication and secrecy codes
- Combinatorial characterizations of authentication codes
- A lower bound on authentication after having observed a sequence of messages
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Information-theoretic bounds for authentication codes and block designs
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- Combinational constructions of splitting authentication codes with perfect secrecy
- Lower bounds for robust secret sharing schemes
- Three constructions of perfect authentication codes from projective geometry over finite fields
- The power of primes: security of authentication based on a universal hash-function family
- scientific article; zbMATH DE number 5732575 (Why is no real title available?)
- Authentication Codes in the Query Model
- scientific article; zbMATH DE number 67089 (Why is no real title available?)
- Codes Which Detect Deception
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- scientific article; zbMATH DE number 4193604 (Why is no real title available?)
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
- A new class of splitting 3-designs
- Combinatorial bounds and characterizations of splitting authentication codes
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
This page was built for publication: New bounds and constructions for authentication/secrecy codes with splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176594)
