Characterization of Optimal Authentication Codes with Arbitration

Authors:
Dingyi Pei;Yuqiang Li;Yejing Wang;Reihaneh Safavi-Naini
Affiliations:
-;-;-;-
Venue:
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Year:
1999

Citing 6
Cited 1

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

Journal of Cryptology
On the construction of perfect authentication codes that permit arbitration

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A2-code = Affine resolvable = BIBD

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract)

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Combinatorial Structure of A-codes with r-fold Security

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Message authentication with arbitration of transmitter/receiver disputes

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques

A new class of 3-fold perfect splitting authentication codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study authentication codes with arbitration (A2-codes). An A2-code is called optimal if its cheating probabilities achieve their information-theoretic lower bounds, and has minimum number of keys. We give characterization of optimal A2 -codes in terms of combinatorial designs. This means that construction of optimal A2- codes is reduced to the construction of the corresponding combinatorial structures.