Open AccessInfinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
Author(s) -
Yeow Meng Chee,
Xiande Zhang,
Hui Zhang
Publication year - 2011
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2011.5.59
Subject(s) - mathematics , spoofing attack , authentication (law) , order (exchange) , discrete mathematics , computer security , computer science , finance , economics
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. © 2011 AIMS-SDU.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom