Powerful Primitives in the Bounded Quantum Storage Model
share
The bounded quantum storage model aims to achieve security against computationally unbounded adversaries that are restricted only with respect to their quantum memories. In this work, we show the power of this model by providing everlasting and information-theoretic secure constructions for the following primitives: (1) Symmetric key encryption, message-authentication and one-time programs. These schemes require no quantum memory for the honest user while they can be made secure against adversaries with arbitrarily large memories. (2) Program broadcast, asymmetric key encryption, encryption tokens, signatures, and signature tokens. These schemes are secure against adversaries with roughly e^√(m) quantum memory where m is the quantum memory required of the honest user. All of the constructions additionally satisfy notions of disappearing and unclonable security.
READ FULL TEXT
