Unconditionally-secure and reusable public-key authentication
Lawrence M. Ioannou, Michele Mosca

TL;DR
This paper introduces a quantum public-key identification protocol that achieves unconditionally-secure and reusable authentication, demonstrating the theoretical possibility of such security with pure-state public keys against any adversary.
Contribution
It presents the first quantum protocol that provides unconditionally-secure, reusable public-key authentication using pure-state public keys.
Findings
Protocol is secure against unbounded adversaries.
First demonstration of unconditionally-secure reusable public-key authentication.
Uses quantum properties to achieve security with pure states.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
