A construction for optimal \(c\)-splitting authentication and secrecy codes
From MaRDI portal
Publication:1650431
DOI10.1007/s10623-017-0421-xzbMath1401.94186OpenAlexW2765190733MaRDI QIDQ1650431
Miao Liang, Beiliang Du, Mingchao Li, Jing-Yuan Chen
Publication date: 3 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0421-x
splitting \(t\)-designssplitting authentication codesauthentication and secrecy codesgroup divisible splitting \(t\)-designs
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Related Items
Construction of authentication codes based on orthogonal array and Latin square, On the equivalence of authentication codes and robust (2, 2)-threshold schemes, On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some new classes of 2-fold optimal or perfect splitting authentication codes
- 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 construction for authentication/secrecy codes from 3-homogeneous permutation groups
- The combinatorics of authentication and secrecy codes
- Further results on the existence of splitting BIBDs and application to authentication codes
- Some constructions and bounds for authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- New bounds and constructions for authentication/secrecy codes with splitting
- A new class of group divisible designs with block size three
- On a fallacious bound for authentication codes
- Bounds and characterizations of authentication/secrecy schemes
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Three constructions of authentication/secrecy codes
- On the construction of authentication and secrecy codes
- A new class of optimal 3-splitting authentication codes
- Optimal (4up, 5, 1) optical orthogonal codes
- Authentication Theory/Coding Theory
- Authentication perpendicular arrays APA1(2, 7, ?)
- Splitting balanced incomplete block designs with block size 3 × 2
- Combinatorial Constructions for Optimal Splitting Authentication Codes
