Skip to main content
Conference ProceedingsOPEN ACCESS

Perfect and essentially perfect authentication schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 304 LNCS 167-170
DOI: 10.1007/3-540-39118-5_16
N/ACitations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Suppose that A wants t o 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.

Cite

CITATION STYLE

APA

Beutelspacher, A. (1988). Perfect and essentially perfect authentication schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 304 LNCS, pp. 167–170). Springer Verlag. https://doi.org/10.1007/3-540-39118-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free