On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L≥2

Authors:
Ben Smeets;Peter Vanroose;Zhe-xian Wan
Affiliations:
-;-;-
Venue:
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Year:
1991

Citing 3
Cited 3

Some constructions for authentication-secrecy codes

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A construction for authentication/secrecy codes from certain combinatorial designs

Journal of Cryptology
Perfect and essentially perfect authentication schemes

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques

Authentication Codes in Plaintext and Chosen-Content Attacks

Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Linear Authentication Codes: Bounds and Constructions

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Crypto topics and applications I

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an analysis of some known Cartesian authentication codes and their modification into authentication codes with secrecy, with transmission rate R = r/n, where n = 2, 3, . . . , and 1 驴 r 驴 n - 1 using (n - r)(r + 1) q-ary key digits. For this purpose we use a grouping technique.Essentially the same key grouping technique is used for the construction of codes that withstand spoofing attacks of order L 驴 2. The information rate of this scheme is also r/n, and it requires (L + r)(n - r) q-ary key digits. Moreover these codes allow that previously transmitted source states can be reused.