The Impossibility Of Secure Two-Party Classical Computation

Abstract

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.

10 pages

References in corpus (1)

• Variable Bias Coin Tossing

Cited by in corpus (33)

• Advances in Quantum Cryptography
• Quantum Cryptography Beyond Quantum Key Distribution
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
• Device-independent two-party cryptography secure against sequential attacks
• Spacetime-constrained oblivious transfer
• Secure Multi-Party Computation with a Dishonest Majority via Quantum Means
• Quantum key distribution based on orthogonal states allows secure quantum bit commitment
• Practical and unconditionally secure spacetime-constrained oblivious transfer
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Quantum protocols for the millionaire problem with a third party are trivial
• Quantum private comparison protocol without a third party
• Universal resources for quantum computing
• Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography
• A Multiparty Quantum Private Equality Comparison scheme relying on $|GH{Z}_3⟩$ states
• Device-independent quantum private comparison protocol without a third party
• Secure quantum weak oblivious transfer against individual measurements
• Quantum non-locality, causality and mistrustful cryptography
• Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
• Practical quantum oblivious transfer with a single photon
• On the Power of Two-Party Quantum Cryptography
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Can relativistic bit commitment lead to secure quantum oblivious transfer?
• Secure Two-Party Quantum Computation Over Classical Channels
• Optimal bounds for semi-honest quantum oblivious transfer
• Quantum preprocessing for information-theoretic security in two-party computation
• Quantum oblivious transfer: a short review
• The standard no-signalling constraints in Bell scenarios are neither sufficient nor necessary for preventing superluminal signalling with general interventions
• Secure Identification in The Isolated Qubits Model
• Impossibility of Quantum Private Queries
• A framework for quantum homomorphic encryption with experimental demonstration
• One-out-of-two Quantum Oblivious Transfer based on Nonorthogonal States
• Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol