Unconditionally-secure and reusable public-key authentication
classification
🪐 quant-ph
keywords
authenticationpublic-keyreusableunconditionally-secureadversarycomputationally-unboundeddemonstratesfirst
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.