论文信息 - Some Constructions for Authentication-Secrecy Codes

Some Constructions for Authentication-Secrecy Codes

We deal with authentication / secrecy codes having unconditional security. Besides some new results for a “spoofing attack of order L”, we give several constructions using finite incidence structures (designs, generalized quadrangles).

M. D. Soete

[1] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2] F. MacWilliams,et al. Codes which detect deception , 1974 .

[3] J. H. Lint,et al. Graph theory, coding theory, and block designs , 1975 .

[4] Haim Hanani,et al. A Class of Three-Designs , 1979, J. Comb. Theory, Ser. A.

[5] Gustavus J. Simmons,et al. Authentication Theory/Coding Theory , 1985, CRYPTO.

[6] Hanfried Lenz,et al. Design theory , 1985 .

[7] J. L. Massey,et al. Cryptography ― a selective survey , 1986 .

[8] Paul Schöbi,et al. Perfect Authentication Systems for Data Sources with Arbitrary Statistics , 1986, EUROCRYPT.

[9] Douglas R. Stinson. Some Constructions and Bounds for authentication Codes , 1986, CRYPTO.

[10] Gustavus J. Simmons,et al. A Natural Taxonomy for Digital Information Authentication Schemes , 1987, CRYPTO.

[11] Albrecht Beutelspacher,et al. Perfect and Essentially Perfect Authentication Schemes , 1987, EUROCRYPT.