Perfect and essentially perfect authentication schemes

Authors:
Albrecht Beutelspacher
Affiliations:
Siemens AG, München, Federal Republicof Germany
Venue:
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Year:
1987

Citing 1
Cited 4

Finite geometries

Finite geometries

Some constructions for authentication-secrecy codes

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Essentially ℓ -fold secure authentication systems

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L≥2

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Bounds and Constructions for Multireceiver Authentication Codes

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose that A wants to send a message M to B. It is important that B receives the message without any alteration. On the other hand, a bad guy X looks for his chance to alter M in his favour. In order t o make the bad guy's life difficult, A authenticates the message M. For this, A and B have to agree on an authentication function f and a secret key K. The function f has M and K as its input, and the authenticator (also called message authentication code) f(M,K) as its output.