Essentially ℓ -fold secure authentication systems

Authors:
Albrecht Beutelspacher;Ute Rosenbaum
Affiliations:
-;-
Venue:
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Year:
1991

Citing 2
Cited 1

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Perfect and essentially perfect authentication schemes

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

Linear Sections of the Finite Veronese Varieties and AuthenticationSystems Defined Using Geometry

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we first introduce the notion of essentially l-fold secure authentication systems; these are authentication systems in which the Bad Guy's chance to cheat after having observed l messages is - up to a constant - best possible. Then we shall construct classes of essentially l-fold secure authentication systems; these systems are based on finite geometries, in particular spreads and quadrics in finite projective spaces.