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

DOI10.1007/s12095-014-0107-4zbMath1326.05022OpenAlexW1977037892MaRDI QIDQ892298

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

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)

Related Items (1)

Multi-part balanced incomplete-block designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 new class of 3-fold perfect splitting authentication codes
• Constructions of new orthogonal arrays and covering arrays of strength three
• Information-theoretic bounds for authentication codes and block designs
• Four Mutually Orthogonal Latin Squares of Order 14
• Existence of Five MOLS of Orders 18 and 60
• A Generalization of a Theorem due to MacNeish

This page was built for publication: A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities