Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences

14Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Vernam scheme protects the privacy unconditionally, but is completely insecure to protect the authenticity of a message. Schemes will be discussed in this paper that protect the authenticity unconditionally. The definition of unconditional security is defined. Stream cipher authentication schemes are proposed. The consequences on information protection using RSA and DES are discussed.

Cite

CITATION STYLE

APA

Desmedt, Y. (1986). Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 218 LNCS, pp. 42–55). Springer Verlag. https://doi.org/10.1007/3-540-39799-X_6

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