Near optimal unconditionally secure authentication
An efficient unconditionally secure authentication scheme with arbitration is presented which is also secure against attacks by the arbiter. Arguments are presented that suggest this scheme is almost optimal with respect to codeword lengths, and when many messages are sent the amount of key data per message approaches, at worst, 1/3 more than the best possible. An improved unconditionally secure authentication scheme without arbitration is also briefly presented.
- Y. Desmedt and M. Yung. Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter's Attacks. Advances in Cryptology — CRYPTO '90, proceedings, Springer-Verlag 1991, pp. 177–188.Google Scholar
- ISO/IEC 9797. Data cryptographic techniques-Data integrity mechanism using a cryptographic check function employing a block cipher algorithm, International Organisation for Standardisation, 1989.Google Scholar
- H. J. Knobloch. A Smart Card Implementation of the Fiat-Shamir Identification Scheme, Advances in Cryptology-EUROCRYPT '88, proceedings, Springer-Verlag 1989, pp. 87–96.Google Scholar
- G. J. Simmons. Message authentication with arbitration of transmitter/receiver disputes. Advances in Cryptology — EUROCRYPT '87, proceedings, Springer-Verlag 1988, pp. 151–165.Google Scholar
- G. J. Simmons. A survey of information Authentication, Contemporary Cryptology — The Science of Information Integrity, 1991, pp. 379–419. IEEE Press, New York.Google Scholar