A construction for optimal c-splitting authentication and secrecy codes
- 19 October 2017
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1739-1755
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (CN) (11501161, 11301370)
- National Natural Science Foundation of China (CN) (11571251)
- China Postdoctoral Science Foundation (2016M601873)
- Natural Science Foundation of Hebei Province (A2016402164)
- Qing Lan Project
This publication has 23 references indexed in Scilit:
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher orderAdvances in Mathematics of Communications, 2011
- Three constructions of authentication/secrecy codesJournal of Pure and Applied Algebra, 2005
- Optimal (4up, 5, 1) optical orthogonal codesJournal of Combinatorial Designs, 2004
- Splitting balanced incomplete block designs with block size 3 × 2Journal of Combinatorial Designs, 2004
- On a Fallacious Bound for Authentication CodesJournal of Cryptology, 1999
- Bounds and Characterizations of Authentication/Secrecy SchemesDesigns, Codes and Cryptography, 1998
- Authentication perpendicular arrays APA1(2, 7, ?)Journal of Combinatorial Designs, 1997
- Authentication perpendicular arrays APA1(2, 5, v)Journal of Combinatorial Designs, 1996
- A new class of group divisible designs with block size threeJournal of Combinatorial Theory, Series A, 1992
- New bounds and constructions for authentication/secrecy codes with splittingJournal of Cryptology, 1991