THE CONSTRUCTIONS OF A2-CODES FROM CONVENTIONAL A-CODES

Gilbert E, MacWillams F, Sloane N. Codes which detect deceptions. Bell Sys. Tech. J.，1974, 53(3): 405-424.[2]Simmons G J. Authentication Theory/Coding Theory. In Advances in Cryptology-Crypt84, New York, NY, USA: 1984, 411-431.[3]裴定一.认证码及其构造的一些研究.CHINACRYPT 92,北京,1992,66-73.[4]Simmons G J. Message authentication with arbitration of transmmiter/receiver disputes. Eurocrypt 87, Norway: 1987, 151-161.[5]Stinson D R, et al. Authentication Codes with Multiple Arbiters. Eurocrypt 88, Denmark: 1988, 51-55.[6]Desmat Y, Moti Y. Arbitrated unconditionally secure authentication can be unconditionally protected against arbiters attacks. Crypt90, California, USA: 1990, 179-193.[7]Taylor R. Near optimal unconditionaVy secure suthentications. Eurocrypt 94, Italy: 1994, 245-255.[8]Shamir A, Riverst R L, Adleman L M. Mental Poker In the Mathematical Gardner, ed. D Klarner, Prindle, Weber Schmidt, Boston, Mass: 1980.[9]Shamir A. How to share a secret, Comm[J].of the ACM.1979, 22(4):612-613[10]Asmuth C. A modular approach to key safeguarding. IEEE Trans. on IT, 1983, IT-29(2): 208-210.[11]王新梅.级连码(k, n)门限通信密钥分散保管方案.通信学报,1987, 8(4): 1-9.[12]Cao Z F. Finite set theory and its applications to cryptology. In Designs, Codes and Finite Geometries, Shanghai Conference, Shanghai: May, 24-28, 1993, 9-10.