A construction of t-fold perfect splitting authentication codes with equal deception probabilities

DOI10.1007/S12095-014-0107-4zbMATH Open1326.05022OpenAlexW1977037892MaRDI QIDQ892298FDOQ892298

Authors Mingchao Li, Miao Liang, Beiliang Du

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

zbMATH Keywords

\(t\)-fold perfect splitting authentication codeorthogonal multi-arraytransversal splitting \(t\)-design

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)

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

Cites work

• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 874490 (Why is no real title available?)
• scientific article; zbMATH DE number 3893245 (Why is no real title available?)
• scientific article; zbMATH DE number 975412 (Why is no real title available?)
• A Generalization of a Theorem due to MacNeish
• A new class of 3-fold perfect splitting authentication codes
• A new class of splitting 3-designs
• Authentication codes and combinatorial designs.
• Combinatorial bounds and characterizations of splitting authentication codes
• Constructions of new orthogonal arrays and covering arrays of strength three
• Existence of Five MOLS of Orders 18 and 60
• Four Mutually Orthogonal Latin Squares of Order 14
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
• Information-theoretic bounds for authentication codes and block designs

Cited in

(1)

• Multi-part balanced incomplete-block designs

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)