Unconditionally-secure and reusable public-key authentication
  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. 
Lawrence M. Ioannou and Michele Mosca
quant-ph