Some new classes of 2-fold optimal or perfect splitting authentication codes

DOI10.1007/S12095-015-0179-9zbMath1355.05057OpenAlexW2306698508MaRDI QIDQ507956

Publication date: 9 February 2017

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0179-9

zbMATH Keywords

restricted strong partially balanced \(t\)-designs splitting \(t\)-designs splitting authentication codes

Mathematics Subject Classification ID

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

Related Items (3)

A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
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
A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
Further results on the existence of splitting BIBDs and application to authentication codes
New bounds and constructions for authentication/secrecy codes with splitting
A new class of group divisible designs with block size three
Balanced incomplete block designs and related designs
Group divisible designs with block-size four
On a fallacious bound for authentication codes
A lower bound on authentication after having observed a sequence of messages
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
Information-theoretic bounds for authentication codes and block designs
A new class of optimal 3-splitting authentication codes
Bounds on the probability of deception in multiple authentication
Splitting balanced incomplete block designs with block size 3 × 2
Message Authentication with Arbitration of Transmitter/Receiver Disputes
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
Combinatorial Constructions for Optimal Splitting Authentication Codes

This page was built for publication: Some new classes of 2-fold optimal or perfect splitting authentication codes