A new class of 3-fold perfect splitting authentication codes
From MaRDI portal
Publication:663455
DOI10.1007/s10623-011-9496-yzbMath1235.05022OpenAlexW2092130061MaRDI QIDQ663455
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9496-y
\(t\)-fold perfect splitting authentication codesCandelabra restricted strong partially balanced \(t\)-systemsRestricted strong partially balanced \(t\)-designs
Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)
Related Items
Three constructions of perfect authentication codes from projective geometry over finite fields, A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities, A construction for \(t\)-fold perfect authentication codes with arbitration, Disjoint difference families and their applications, Some new classes of 2-fold optimal or perfect splitting authentication codes, On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
- Combinatorial bounds and characterizations of splitting authentication codes
- Candelabra systems and designs
- Further results on the existence of splitting BIBDs and application to authentication codes
- The fundamental construction for 3-designs
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Information-theoretic bounds for authentication codes and block designs
- A new class of optimal 3-splitting authentication codes
- On Quadruple Systems
- An improvement on H design
- Splitting balanced incomplete block designs with block size 3 × 2
- Combinatorial Constructions for Optimal Splitting Authentication Codes
