Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications

DOI10.1007/978-3-662-53015-3_2zbMath1406.94048arXiv1607.08168OpenAlexW2487333573MaRDI 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

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Secure certification of mixed quantum states with application to two-party randomness generation ⋮ Oblivious transfer is in MiniQCrypt

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

This page was built for publication: Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications