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 provide information-theoretic secure constructions in this model for the following powerful primitives: (1) CCA1-secure symmetric key encryption, message authentication codes, 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 by increasing the transmission length sufficiently. (2) CCA1-secure asymmetric key encryption, encryption tokens, signatures, signature tokens, and program broadcast. These schemes are secure against adversaries with roughly $e^{\sqrt{m}}$ quantum memory where $m$ is the quantum memory required for the honest user. All of the constructions additionally satisfy notions of disappearing and unclonable security.

翻译：有界量子存储模型旨在针对具有无界计算能力但受限于其量子存储器的对手实现安全性。在本工作中，我们在此模型下为以下强原语提供了信息论安全构造：(1) CCA1安全对称密钥加密、消息认证码和一次性程序。这些方案对诚实用户无需量子存储，同时可通过充分增加传输长度来使其能够抵御任意大存储量的对手。(2) CCA1安全非对称密钥加密、加密令牌、签名、签名令牌和程序广播。这些方案能够抵御存储量约为$e^{\sqrt{m}}$量子的对手，其中$m$是诚实用户所需的量子存储量。所有构造均额外满足消失性和不可克隆性安全概念。