Combinatorial bounds and characterizations of splitting authentication codes

DOI10.1007/S12095-010-0020-4zbMATH Open1198.94100arXiv1001.3780OpenAlexW3104564360MaRDI QIDQ601095FDOQ601095

Authors: Michael Huber 

Publication date: 3 November 2010

Published in: Cryptography and Communications (Search for Journal in Brave)

Abstract: We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.

Full work available at URL: https://arxiv.org/abs/1001.3780

Recommendations

• A construction for optimal \(c\)-splitting authentication and secrecy codes
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
• Information-theoretic bounds for authentication codes and block designs
• Combinational constructions of splitting authentication codes with perfect secrecy
• Combinatorial Constructions for Optimal Splitting Authentication Codes

Mathematics Subject Classification ID

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

Cites Work

• The CRC handbook of combinatorial designs
• Communication Theory of Secrecy Systems*
• Authentication codes and combinatorial designs.
• Lower bounds on the probability of deception in authentication with arbitration
• Codes Which Detect Deception
• New bounds and constructions for authentication/secrecy codes with splitting
• On a fallacious bound for authentication codes
• Title not available (Why is that?)
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Title not available (Why is that?)
• Combinatorial bounds on authentication codes with arbitration.
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Combinatorial characterizations of authentication codes. II
• Title not available (Why is that?)
• Coding theory and algebraic combinatorics
• Flag-transitive Steiner Designs
• A new class of optimal 3-splitting authentication codes
• Splitting balanced incomplete block designs with block size 3 × 2
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Combinatorial characterizations of authentication codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• The combinatorics of authentication and secrecy codes

Cited In (12)

• Title not available (Why is that?)
• A construction for \(t\)-fold perfect authentication codes with arbitration
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
• A new class of splitting 3-designs
• Disjoint difference families and their applications
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• A new class of 3-fold perfect splitting authentication codes
• Information-theoretic bounds for authentication codes and block designs
• A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
• Authentication codes and bipartite graphs
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Some new classes of 2-fold optimal or perfect splitting authentication codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601095)