A2-code = Affine resolvable = BIBD
暂无分享，去创建一个
We say that an A2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We first show that an optimum A2-code implies an affine α-resolvable design. Next, we define an affine α-resolvable + BIBD design and prove that an optimum A2-code is equivalent to an affine α-resolvable + BIBD design.
[1] J. L. Massey,et al. Cryptography ― a selective survey , 1986 .
[2] Gustavus J. Simmons,et al. Message Authentication with Arbitration of Transmitter/Receiver Disputes , 1987, EUROCRYPT.
[3] Thomas Johansson. Lower bounds on the probability of deception in authentication with arbitration , 1994, IEEE Trans. Inf. Theory.