Some new classes of 2-fold optimal or perfect splitting authentication codes
type: Item
instance of: scholarly article
title: Some new classes of 2-fold optimal or perfect splitting authentication codes
zbMATH Open document ID: 1355.05057
author: Miao Liang
author: Lijun Ji
author: Jingcai Zhang
published in: Cryptography and Communications
publication date: 2017-02-09T00:00:00Z
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6682786
zbMATH Keywords: splitting \(t\)-designs
zbMATH Keywords: restricted strong partially balanced \(t\)-designs
zbMATH Keywords: splitting authentication codes
MaRDI profile type: Publication
full work available at URL: s12095-015-0179-9
OpenAlex ID: W2306698508
cites work: On a fallacious bound for authentication codes
cites work: Group divisible designs with block-size four
cites work: Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
cites work: A new class of group divisible designs with block size three
cites work: Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
cites work: New bounds and constructions for authentication/secrecy codes with splitting
cites work: Splitting balanced incomplete block designs with block size 3 × 2
cites work: Q4659604
cites work: Combinatorial Constructions for Optimal Splitting Authentication Codes
cites work: Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
cites work: Q4865141
cites work: Balanced incomplete block designs and related designs
cites work: Combinatorial bounds and characterizations of splitting authentication codes
cites work: A new class of splitting 3-designs
cites work: A new class of 3-fold perfect splitting authentication codes
cites work: Existence of optimal restricted strong partially balanced designs
cites work: A new class of \(2\)-fold perfect \(4\)-splitting authentication codes.
cites work: New combinatorial designs and their applications to authentication codes and secret sharing schemes.
cites work: Information-theoretic bounds for authentication codes and block designs
cites work: Q4250649
cites work: A lower bound on authentication after having observed a sequence of messages
cites work: Q4279700
cites work: Message Authentication with Arbitration of Transmitter/Receiver Disputes
cites work: A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
cites work: Bounds on the probability of deception in multiple authentication
cites work: A new class of optimal 3-splitting authentication codes
cites work: Further results on the existence of splitting BIBDs and application to authentication codes
DOI: 10.1007/S12095-015-0179-9
description: scientific article; zbMATH DE number 6682786