Composable Security in the Bounded-Quantum-Storage Model
From MaRDI portal
Recommendations
Cites work
- Coin flipping by telephone a protocol for solving impossible problems
- Composing Quantum Protocols in a Classical Environment
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1302858 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- Oblivious-Transfer Amplification
- Quantum information theory. An introduction.
- Quantum Oblivious Transfer
- Security and composition of multiparty cryptographic protocols
- Security of quantum bit string commitment depends on the information measure
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Symmetric authentication within a simulatable cryptographic library
- Theory of Cryptography
- Universal classes of hash functions
- Universally composable two-party and multi-party secure computation
Cited in
(15)- Concurrent composition in the bounded quantum storage model
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- Improving the Security of Quantum Protocols via Commit-and-Open
- Cryptography in the Bounded-Quantum-Storage Model
- Universally composable quantum multi-party computation
- Composing Quantum Protocols in a Classical Environment
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
- STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement
- scientific article; zbMATH DE number 7071497 (Why is no real title available?)
- Long-term security and universal composability
- Memory-sample lower bounds for learning with classical-quantum hybrid memory
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- The round complexity of proofs in the bounded quantum storage model
- An integrated hierarchical dynamic quantum secret sharing protocol
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Composable Security 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 Q3519536)