Combinational constructions of splitting authentication codes with perfect secrecy
From MaRDI portal
Publication:2673993
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
Cites work
- scientific article; zbMATH DE number 3856985 (Why is no real title available?)
- scientific article; zbMATH DE number 5130671 (Why is no real title available?)
- scientific article; zbMATH DE number 4095378 (Why is no real title available?)
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 1303980 (Why is no real title available?)
- scientific article; zbMATH DE number 3895109 (Why is no real title available?)
- A new class of group divisible designs with block size three
- A new class of optimal 3-splitting authentication codes
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Authentication Theory/Coding Theory
- Existence of optimal restricted strong partially balanced designs
- Existence of optimal strong partially balanced designs
- Group divisible designs with block size four and group type \(g^u m^1\) for \(g \equiv 0 \bmod 6\)
- New bounds and constructions for authentication/secrecy codes with splitting
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- On a fallacious bound for authentication codes
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- Optical orthogonal codes: design, analysis and applications
- 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
- The CRC handbook of combinatorial designs
- The combinatorics of authentication and secrecy codes
- Two new direct product‐type constructions for resolvable group‐divisible designs
Cited in
(13)- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
- Two combinatorial designs and their applications to authentication codes
- 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
- A new class of 3-fold perfect splitting authentication codes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Combinatorial bounds and characterizations of splitting authentication codes
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- scientific article; zbMATH DE number 5732575 (Why is no real title available?)
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
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)
