A new class of optimal 3-splitting authentication codes
From MaRDI portal
Publication:2491277
DOI10.1007/S10623-005-1501-XzbMath1172.94627OpenAlexW4249185595MaRDI QIDQ2491277
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
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Related Items (9)
A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ 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 new class of splitting 3-designs ⋮ Further results on the existence of splitting BIBDs and application to authentication codes
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
This page was built for publication: A new class of optimal 3-splitting authentication codes
