Some new classes of 2-fold optimal or perfect splitting authentication codes
DOI10.1007/S12095-015-0179-9zbMATH Open1355.05057OpenAlexW2306698508MaRDI QIDQ507956FDOQ507956
Authors: Miao Liang, Lijun Ji, Jingcai Zhang 
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
Recommendations
- A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
- A new class of 3-fold perfect splitting authentication codes
- Existence of optimal restricted strong partially balanced designs
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Combinational constructions of splitting authentication codes with perfect secrecy
restricted strong partially balanced \(t\)-designssplitting \(t\)-designssplitting authentication codes
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Message authentication with arbitration of transmitter/receiver disputes
- New bounds and constructions for authentication/secrecy codes with splitting
- On a fallacious bound for authentication codes
- Balanced incomplete block designs and related designs
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Title not available (Why is that?)
- A new class of 3-fold perfect splitting authentication codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- A new class of group divisible designs with block size three
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
- Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
- Group divisible designs with block-size four
- Information-theoretic bounds for authentication codes and block designs
- 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 lower bound on authentication after having observed a sequence of messages
- A new class of optimal 3-splitting authentication codes
- A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
- Existence of optimal restricted strong partially balanced designs
- Title not available (Why is that?)
- Bounds on the probability of deception in multiple authentication
- Splitting balanced incomplete block designs with block size 3 × 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Further results on the existence of splitting BIBDs and application to authentication codes
Cited In (11)
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
- A new class of splitting 3-designs
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
- Existence of optimal restricted strong partially balanced designs
- A new class of 3-fold perfect splitting authentication codes
- Combinational constructions of splitting authentication codes with perfect secrecy
- 2-secure codes from 2-SFP codes
- Two combinatorial designs and their applications to authentication codes
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507956)
