Powerful Primitives in the Bounded Quantum Storage Model

arXiv:2302.05724 · cs.CR, quant-ph · Submitted 2023-02-11 · Read on arXiv

cs.CR, quant-ph

Submitted: 2023-02-11

Updated: 2026-09-20

Comments: 58 pages

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Verification — 20× in this paper · explained in 2 episodes
• Sparsity — 5× in this paper · explained in 4 episodes
• Hilbert Space — 4× in this paper · explained in 2 episodes
• Trace — 4× in this paper · explained in 2 episodes
• Bounded Classical Storage Model — 3× in this paper
• Generalization — 2× in this paper · explained in 13 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Adversarial Attacks — 1× in this paper · explained in 1 episode
• Decode — 1× in this paper · explained in 2 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes

Sources

• How to Sign Quantum Messages
• Authentication of Quantum Messages
• A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions
• Cryptography In the Bounded Quantum-Storage Model
• Efficient Quantum Public-Key Encryption From Learning With Errors
• Uncloneable Encryption
• Quantum Digital Signatures
• Private Quantum Channels and the Cost of Randomizing Quantum Information
• Universally composable privacy amplification against quantum adversaries
• Cryptography in the Bounded-Quantum-Storage Model
• Cryptography from Noisy Storage

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs