GOB designs for authentication codes with arbitration

Authors:
Gennian Ge;Ying Miao;L. Zhu
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, P. R. China 310027;Department of Social Systems and Management, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan 305-8573;Department of Mathematics, Suzhou University, Suzhou, P. R. China 215006
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 7
Cited 1

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Authentication codes with multiple arbiters

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
The combinatorics of authentication and secrecy codes

Journal of Cryptology
A Cartesian product construction for unconditionally secure authentication codes that permit arbitration

Journal of Cryptology
Combinatorial Classification of Optimal AuthenticationCodes with Arbitration

Designs, Codes and Cryptography
Combinatorial Bounds on Authentication Codes with Arbitration

Designs, Codes and Cryptography
A2-code = Affine resolvable = BIBD

ICICS '97 Proceedings of the First International Conference on Information and Communication Security

Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine 驴-resolvable + BIBDs and 驴-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structure simplifies the characterization, and enables us to extend Johansson's well-known family of optimal authentication codes with arbitration to any finite projective spaces with dimension greater than or equal to 3.