Combinatorial bounds and characterizations of splitting authentication codes

DOI10.1007/S12095-010-0020-4zbMath1198.94100arXiv1001.3780OpenAlexW3104564360MaRDI QIDQ601095

Michael Huber

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

Mathematics Subject Classification ID

Cryptography (94A60) Applications of design theory to circuits and networks (94C30)

Related Items (7)

A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities ⋮ A construction for \(t\)-fold perfect authentication codes with arbitration ⋮ Disjoint difference families and their applications ⋮ A new class of 3-fold perfect splitting authentication codes ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ A new class of splitting 3-designs

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.

This page was built for publication: Combinatorial bounds and characterizations of splitting authentication codes