Universally Composable Quantum Multi-Party Computation

Abstract

The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the same compositionality guarantees. We prove that in this model statistically secure oblivious transfer protocols can be constructed from commitments. Furthermore, we show that every statistically classically UC secure protocol is also statistically quantum UC secure. Such implications are not known for other quantum security definitions. As a corollary, we get that quantum UC secure protocols for general multi-party computation can be constructed from commitments.

References in corpus (1)

• Universally Composable Quantum Multi-Party Computation

Cited by in corpus (47)

• Random Oracles in a Quantum World
• Security in Quantum Cryptography
• Quantum Cryptography Beyond Quantum Key Distribution
• Universally Composable Quantum Multi-Party Computation
• Robustness and device independence of verifiable blind quantum computing
• Quantum one-time programs
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
• Composable security of delegated quantum computation
• Multiparty Delegated Quantum Computing
• Key recycling in authentication
• A Quantum Money Solution to the Blockchain Scalability Problem
• Quantum authentication with key recycling
• Causal Boxes: Quantum Information-Processing Systems Closed under Composition
• Computational Security of Quantum Encryption
• Quantum Fully Homomorphic Encryption With Verification
• Efficient Simulation for Quantum Message Authentication
• A device-independent protocol for XOR oblivious transfer
• Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
• Composable security in relativistic quantum cryptography
• Blind quantum computing with two almost identical states
• Security Limitations of Classical-Client Delegated Quantum Computing
• Smart contracts meet quantum cryptography
• Towards Quantum One-Time Memories from Stateless Hardware
• Composable and Finite Computational Security of Quantum Message Transmission
• Quantum one-time tables for unconditionally secure qubit-commitment
• Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
• Categorical composable cryptography
• New security notions and feasibility results for authentication of quantum data
• Communication Complexity of Private Simultaneous Quantum Messages Protocols
• On the Efficiency of Classical and Quantum Secure Function Evaluation
• Impossibility of composable Oblivious Transfer in relativistic quantum cryptography
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
• Cryptographic Protocols under Quantum Attacks
• Oblivious Transfer is in MiniQCrypt
• Quantum One-Time Memories from Stateless Hardware
• Towards practical secure delegated quantum computing with semi-classical light
• Quantum Universally Composable Oblivious Linear Evaluation
• On the composable security of weak coin flipping
• Performance of Practical Quantum Oblivious Key Distribution
• Secure Two-Party Quantum Computation Over Classical Channels
• Quantum oblivious transfer: a short review
• Star-specific Key-homomorphic PRFs from Learning with Linear Regression
• Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
• Supersingular Isogeny Oblivious Transfer (SIOT)
• On the Security of Password-Authenticated Quantum Key Exchange
• Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
• Noise-Tolerant Quantum Tokens for MAC