Bounds and Characterizations of Authentication/Secrecy Schemes

被引：14

作者：

Casse L.R.A. ^{[1
]}

Martin K.M. ^{[1
]}

Wild P.R. ^{[2
]}

机构：

[1] Department of Pure Mathematics, University of Adelaide, Adelaide

[2] Department of Mathematics, Royal Holloway, University of London Egham

来源：

Designs, Codes and Cryptography | 1998年 / 13卷 / 2期

基金：

澳大利亚研究理事会;

关键词：

Authentication scheme; Bounds; Orthogonal arrays; Secrecy scheme;

D O I：

10.1023/A:1008270111149

中图分类号：

学科分类号：

摘要：

We consider authentication/secrecy schemes from the information theoretic approach. We extend results on unconditionally secure authentication schemes and then consider unconditionally secure authentication schemes that offer perfect L-fold secrecy. We consider both ordered and unordered secrecy. We establish entropy bounds on the encoding rules for authentication schemes with these types of secrecy. We provide some combinatorial characterizations and constructions for authentication schemes having perfect L-fold secrecy that meet these bounds.

引用

页码：107 / 129

页数：22

共 19 条

[1]

De Soete, M., Some constructions for authentication-secrecy codes (1988) Advances in Cryptology-EUROCRYPT '88, Lecture Notes in Comput. Sci., 330, pp. 57-75

[2]

Brickell, E.F., A few results in message authentication (1984) Congressus Numerantium, 43, pp. 141-154

[3]

Fåk, V., Repeated use of codes which detect deception (1979) IEEE Trans. on Inf. Theory, 25, pp. 233-234

[4]

Gilbert, E., MacWilliams, F.J., Sloane, N.J.A., Codes which detect deception (1974) Bell Systems Tech. J., 53, pp. 405-424

[5]

Godlewski, P., Mitchell, C., Key-minimal cryptosystems for unconditional secrecy (1990) J. Cryptology, 3, pp. 1-25

[6]

Massey, J.L., Cryptography-a selective survey (1986) Digital Communications, pp. 3-21. , North-Holland

[7]

Mitchell, C., Walker, M., Wild, P., The combinatorics of perfect authentication schemes (1994) SIAM J. Disc. Math., 7, pp. 102-107

[8]

Pei, D., Information-theoretic bounds for authentication codes and block designs (1995) J. Cryptology, 8, pp. 177-188

[9]

Pei, D., Wang, Y., Authentication Codes Achieving Information-theoretic Bounds, , preprint

[10]

Rosenbaum, U., A lower bound on authentication after having observed a sequence of messages (1993) J. Cryptology, 6, pp. 135-156

← 1 2 →