Combinational constructions of splitting authentication codes with perfect secrecy
- 25 August 2022
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (10) , 2491-2515
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11871363)
This publication has 16 references indexed in Scilit:
- Existence of optimal strong partially balanced designsApplied Mathematics-A Journal of Chinese Universities, 2007
- A New Class of Optimal 3-splitting Authentication CodesDesigns, Codes and Cryptography, 2006
- New combinatorial designs and their applications to authentication codes and secret sharing schemesDiscrete Mathematics, 2004
- On a Fallacious Bound for Authentication CodesJournal of Cryptology, 1999
- Two new direct product-type constructions for resolvable group-divisible designsJournal of Combinatorial Designs, 1993
- 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
- The combinatorics of authentication and secrecy codesJournal of Cryptology, 1990
- Optical orthogonal codes: design, analysis and applicationsIEEE Transactions on Information Theory, 1989
- An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjecturesJournal of Combinatorial Theory, Series A, 1972