Combinatorial bounds and characterizations of splitting authentication codes
From MaRDI portal
Publication:601095
DOI10.1007/s12095-010-0020-4zbMath1198.94100arXiv1001.3780MaRDI QIDQ601095
Publication date: 3 November 2010
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3780
Related Items
A construction for \(t\)-fold perfect authentication codes with arbitration, Some new classes of 2-fold optimal or perfect splitting authentication codes, A new class of splitting 3-designs, A new class of 3-fold perfect splitting authentication codes, A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities, Disjoint difference families and their applications, A construction for optimal \(c\)-splitting authentication and secrecy codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The combinatorics of authentication and secrecy codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- New bounds and constructions for authentication/secrecy codes with splitting
- Combinatorial characterizations of authentication codes
- On a fallacious bound for authentication codes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Combinatorial characterizations of authentication codes. II
- A new class of optimal 3-splitting authentication codes
- Coding Theory and Algebraic Combinatorics
- Communication Theory of Secrecy Systems*
- Lower bounds on the probability of deception in authentication with arbitration
- Codes Which Detect Deception
- Splitting balanced incomplete block designs with block size 3 × 2
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Flag-transitive Steiner Designs
- Combinatorial bounds on authentication codes with arbitration.
