Combinatorial bounds and characterizations of splitting authentication codes

DOI10.1007/S12095-010-0020-4MaRDI QIDQ601095zbMATH OpenOpenAlexFDO

Authors 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)

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.

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

Cites work

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

Cited in

(12)

• Authentication codes and bipartite graphs
• Information-theoretic bounds for authentication codes and block designs
• Disjoint difference families and their applications
• 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
• A new class of 3-fold perfect splitting authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• scientific article; zbMATH DE number 5732575 (Why is no real title available?)
• Some new classes of 2-fold optimal or perfect splitting authentication codes
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities

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)