A construction of t-fold perfect splitting authentication codes with equal deception probabilities
DOI10.1007/S12095-014-0107-4zbMATH Open1326.05022OpenAlexW1977037892MaRDI QIDQ892298FDOQ892298
Miao Liang, Beiliang Du, Mingchao Li
Publication date: 18 November 2015
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0107-4
Recommendations
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
- A new class of 3-fold perfect splitting authentication codes
- An extension of authentication codes based on BIBDs
- On the construction of authentication and secrecy codes
\(t\)-fold perfect splitting authentication codeorthogonal multi-arraytransversal splitting \(t\)-design
Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A Generalization of a Theorem due to MacNeish
- Constructions of new orthogonal arrays and covering arrays of strength three
- Authentication codes and combinatorial designs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new class of 3-fold perfect splitting authentication codes
- Four Mutually Orthogonal Latin Squares of Order 14
- Title not available (Why is that?)
- Existence of Five MOLS of Orders 18 and 60
- 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
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892298)
