Unconditionally-secure and reusable public-key authentication

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.

to appear in Proceedings of the 6th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2011)