Powerful primitives in the bounded quantum storage model

DOI10.4230/LIPICS.ITC.2025.2MaRDI QIDQ7299417zbMATH OpenFDO

Authors Mohammed Barhoush, Louis Salvail

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2025.2

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
• Authentication in the bounded storage model
• Authentication of quantum messages
• Coding theorem and strong converse for quantum channels
• Computational Indistinguishability Between Quantum States and Its Cryptographic Application
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Cryptography in the Bounded-Quantum-Storage Model
• Disappearing cryptography in the bounded storage model
• Fast learning requires good memory: a time-space lower bound for parity learning
• Founding Cryptography on Tamper-Proof Hardware Tokens
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Incompressible cryptography
• One-Time Programs
• Sampling of Min-Entropy Relative to Quantum Knowledge
• Simple schemes in the bounded storage model
• The impossibility of obfuscation with auxiliary input or a universal simulator
• The Operational Meaning of Min- and Max-Entropy
• Theory of Cryptography

This page was built for publication: Powerful primitives in the bounded quantum storage model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299417)