A CONSTRUCTION FOR UNCONDITIONALLY SECURE AUTHENTICATION CODES WITH ARBITRATION OBTAINED FROM COMBINATORIAL DESIGNS

Simmons G J. A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, J.Cryptology，1990, 2(2): 77-104.[2] Johansson T. Authentication codes for nontrusting parties obtained from rank metric codes,Designs Codes and Cryptography, 1995, 6(1): 205-218.[2]Johansson T. Lower bounds on the probability of deception in authentication with arbitration, IEEE Trans. on IT, 1994, IT-40(5): 1573-1585.[3]Brickell E F, Stinson D R. Authentication codes with multiple arbiters, Proceedings of Euro-[4]crypt'88, Berlin: Springer-Verlag, 1988, 51-55.[5]Stinson D R. A construction for authentication/ secrecy codes from certain combinatorial designs, J[J].Crytology.1988, 1(1):119-127[6]Stinson D R. The combinatorics of authentication and secrecy codes, J[J].Crytology.1990, 2(1):23-49[7]Kurosawa K. New bound on uthentication code with arbitration, Proceedings of Crypto'94, Lec-[8]ture notes in computer sicence, LNCS899, Berlin: Springer Verlag, 1989, 140-149.