Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
From MaRDI portal
Publication:2829942
DOI10.1007/978-3-662-53015-3_2zbMath1406.94048arXiv1607.08168MaRDI QIDQ2829942
Louis Salvail, Philippe Lamontagne, Frédéric Dupuis, Serge Fehr
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.08168
Related Items
Cites Work
- The quantum reverse Shannon theorem based on one-shot information theory
- A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
- Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
- More general completeness theorems for secure two-party computation
- Cryptography in the Bounded-Quantum-Storage Model
- Universally Composable Quantum Multi-party Computation
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
- Sampling in a Quantum Population, and Applications
- Quantum Oblivious Transfer
- Quantum cryptography using any two nonorthogonal states
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World
- The Operational Meaning of Min- and Max-Entropy
- Theory of Cryptography