A construction for \(t\)-fold perfect authentication codes with arbitration
From MaRDI portal
Publication:404930
DOI10.1007/S10623-013-9826-3zbMath1297.05034OpenAlexW2027157001MaRDI QIDQ404930
Beiliang Du, Mingchao Li, Miao Liang
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9826-3
\(t\)-fold perfect authentication code with arbitrationperfect strong strict restricted partially balanced \(t\)-design
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- 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
- On resolvable designs
- Lower bounds on the probability of deception in authentication with arbitration
- Message Authentication with Arbitration of Transmitter/Receiver Disputes
- Orthogonal Arrays of Index Unity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A construction for \(t\)-fold perfect authentication codes with arbitration
