2000 character limit reached
Unconditionally-secure and reusable public-key authentication
Published 14 Aug 2011 in quant-ph | (1108.2887v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.