Abstract
In this paper we first introduce the notion of essentially ℓ-fold secure authentication systems; these are authentication systems in which the Bad Guy’s chance to cheat after having observed ℓ messages is - up to a constant - best possible. Then we shall construct classes of essentially ℓ-fold secure authentication systems; these systems are based on finite geometries, in particular spreads and quadrics in finite projective spaces.
Cite
CITATION STYLE
Beutelspacher, A., & Rosenbaum, U. (1991). Essentially ℓ-fold secure authentication systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 294–305). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
