A new class of optimal 3-splitting authentication codes

DOI10.1007/S10623-005-1501-XMaRDI QIDQ2491277zbMATH OpenOpenAlexFDO

Authors J. H. Wang

Publication date 29 May 2006

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-005-1501-x

zbMATH Keywords

difference familysplitting authentication codesplitting balanced incomplete design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Further results on the existence of splitting BIBDs and application to authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Splitting balanced incomplete block designs with block size 3 × 2
• A new class of splitting 3-designs
• scientific article; zbMATH DE number 2147946

Cites work

• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Authentication Theory/Coding Theory
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Lower bounds on the probability of deception in authentication with arbitration
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• Splitting balanced incomplete block designs with block size 3 × 2

Cited in

(10)

• A construction for optimal \(c\)-splitting authentication and secrecy codes
• Combinational constructions of splitting authentication codes with perfect secrecy
• Some new classes of 2-fold optimal or perfect splitting authentication codes
• 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
• Decomposing complete graphs into isomorphic complete multipartite graphs
• A new class of 3-fold perfect splitting authentication codes
• Disjoint difference families and their applications
• Further results on the existence of splitting BIBDs and application to authentication codes

This page was built for publication: A new class of optimal 3-splitting authentication codes

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