Composable Security in the Bounded-Quantum-Storage Model

Understand

We present a simplified framework for proving sequential composability in the quantum setting.

• In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols.
• Damgard et al.
• (FOCS '05, CRYPTO '07) showed how to securely implement bit commitment and oblivious transfer in the bounded-quantum-storage model, where the adversary is only allowed to store a limited number of qubits.