Combinational constructions of splitting authentication codes with perfect secrecy
DOI10.1007/S10623-022-01092-6zbMATH Open1497.94140OpenAlexW4293090401WikidataQ114849672 ScholiaQ114849672MaRDI QIDQ2673993FDOQ2673993
Authors: Miao Liang, Yanting Wang, Lijun Ji 
Publication date: 22 September 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01092-6
Recommendations
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- An extension of authentication codes based on BIBDs
group divisible designssplitting authentication codesrobust (2,2)-thresholdsplitting packing designs
Cryptography (94A60) Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- The CRC handbook of combinatorial designs
- Existence of optimal strong partially balanced designs
- New bounds and constructions for authentication/secrecy codes with splitting
- On a fallacious bound for authentication codes
- Title not available (Why is that?)
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Authentication Theory/Coding Theory
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Optical orthogonal codes: design, analysis and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 \(g \equiv 0 \bmod 6\)
- Two new direct product‐type constructions for resolvable group‐divisible designs
- A new class of optimal 3-splitting authentication codes
- Existence of optimal restricted strong partially balanced designs
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Title not available (Why is that?)
- The combinatorics of authentication and secrecy codes
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
Cited In (13)
- Title not available (Why is that?)
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
- Combinatorial bounds and characterizations of splitting authentication codes
- Title not available (Why is that?)
- 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.
- A new class of 3-fold perfect splitting authentication codes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Two combinatorial designs and their applications to authentication codes
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Some new classes of 2-fold optimal or perfect splitting authentication codes
This page was built for publication: Combinational constructions of splitting authentication codes with perfect secrecy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673993)
