Combinatorial Constructions for Optimal Splitting Authentication Codes

DOI10.1137/S0895480103435469zbMath1076.94024OpenAlexW2064770039MaRDI QIDQ5317578

Gennian Ge, Ying Miao, Li-hua Wang

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480103435469

zbMATH Keywords

graph designoptimalsplitting authentication codesplitting group divisible designsplitting balanced incomplete block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Authentication, digital signatures and secret sharing (94A62)

Related Items (13)

Existence on splitting-balanced block designs with resolvability ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ 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 note on cyclic almost difference families ⋮ A new class of splitting 3-designs ⋮ Further results on the existence of splitting BIBDs and application to authentication codes ⋮ A new class of optimal 3-splitting authentication codes ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Perfect difference systems of sets and Jacobi sums

This page was built for publication: Combinatorial Constructions for Optimal Splitting Authentication Codes