A new class of optimal 3-splitting authentication codes

DOI10.1007/s10623-007-9104-3 10.1007/s10623-005-1501-x; 10.1007/s10623-007-9104-3zbMath1172.94627MaRDI QIDQ2491277

Jin-Hua 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 family; splitting authentication code; splitting balanced incomplete design

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

94A62: Authentication, digital signatures and secret sharing

Related Items

Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes, 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, 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, A construction for optimal \(c\)-splitting authentication and secrecy codes, Combinational constructions of splitting authentication codes with perfect secrecy

Cites Work

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