Codes which detect deception
暂无分享,去创建一个
We consider a new kind of coding problem, which has applications in a variety of situations. A message x is to be encoded using a key m to form an encrypted message y = Φ(x, m), which is then supplied to a user G. G knows m and so can calculate x. It is desired to choose Φ(.,.) so as to protect G against B, who knows x, y, and Φ(.,.) (but not m); B may substitute a false message y' for y. It is shown that if the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1. Several encoding functions Φ(.,.) are given, some of which achieve this bound.
[1] J. J. Kelly. A new interpretation of information rate , 1956 .
[2] E. Watson. Primitive Polynomials (Mod 2) , 1962 .
[3] Thomas C. Bartee,et al. Computation with Finite Fields , 1963, Inf. Control..
[4] S. Golomb. Run-length encodings. , 1966 .
[5] Thomas M. Cover,et al. The two-armed-bandit problem with time-invariant finite memory , 1970, IEEE Trans. Inf. Theory.