Skip to main content
Conference Proceedings

Unconditionally-secure and reusable public-key authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 6745 LNCS 121-142
DOI: 10.1007/978-3-642-54429-3_8
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ioannou, L. M., & Mosca, M. (2014). Unconditionally-secure and reusable public-key authentication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6745 LNCS, pp. 121–142). Springer Verlag. https://doi.org/10.1007/978-3-642-54429-3_8

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