Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order

DOI10.3934/AMC.2011.5.59zbMATH Open1227.05110arXiv1010.0280OpenAlexW2963896243MaRDI QIDQ534518FDOQ534518

Authors: Yeow Meng Chee, Hui Zhang, Xian De Zhang 

Publication date: 17 May 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known infinite family of optimal authentication codes with splitting that are secure against spoofing attacks of order two.

Full work available at URL: https://arxiv.org/abs/1010.0280

Recommendations

• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Combinatorial bounds and characterizations of splitting authentication codes
• Some new classes of 2-fold optimal or perfect splitting authentication codes
• scientific article; zbMATH DE number 1153455
• scientific article; zbMATH DE number 842002
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• scientific article; zbMATH DE number 177042
• Combinational constructions of splitting authentication codes with perfect secrecy
• New bounds and constructions for authentication/secrecy codes with splitting
• Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes

zbMATH Keywords

authentication codesplitting \(t\)-designsplitting authentication code

Mathematics Subject Classification ID

Other designs, configurations (05B30) Authentication, digital signatures and secret sharing (94A62) Applications of design theory to circuits and networks (94C30) Cyclotomy (11T22)

Cited In (9)

• Title not available (Why is that?)
• A construction for \(t\)-fold perfect authentication codes with arbitration
• Combinatorial bounds and characterizations of splitting authentication codes
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• A new class of 3-fold perfect splitting authentication codes
• Existence on splitting-balanced block designs with resolvability
• A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
• Some new classes of 2-fold optimal or perfect splitting authentication codes
• Title not available (Why is that?)

This page was built for publication: Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534518)