Quantum preprocessing for information-theoretic security in two-party computation
arXiv:1908.05584
Abstract
In classical two-party computation, a trusted initializer who prepares certain initial correlations, known as one-time tables, can help make the inputs of both parties information-theoretically secure. We propose some bipartite quantum protocols with possible aborts for approximately generating such bipartite classical correlations with varying degrees of privacy, without introducing a third party. Under some weak requirements for the parties, the security level is nontrivial for use in bipartite computation. We show that the security is sometimes dependent on the noise level, but we propose a method for dealing with noise. The security is "forced security", which implies that the probability that some useful one-time tables are generated can approach in the noiseless case under quite weak assumptions about the parties, although the protocols allow aborts. We show how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption. Our methods provide check-based implementations of some no-signaling correlations, including the PR-box type, with the help of communication which carry no information about the inputs in the generated correlations.
arXiv comment24 pages, 2 figures. Simplified Protocol 2. Reduced the cost estimate for Scheme 2. Text revisions in Sections 2-4
References in corpus (16)
- Information Causality as a Physical Principle
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Insecurity of Quantum Secure Computations
- General properties of Nonsignaling Theories
- Locking classical correlation in quantum states
- Cheat Sensitive Quantum Bit Commitment
- Quantum walks with encrypted data
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- Symmetric quantum fully homomorphic encryption with perfect security
- The Impossibility Of Secure Two-Party Classical Computation
- Limitations on information theoretically secure quantum homomorphic encryption
- Quantum homomorphic encryption from quantum codes
- Practical quantum somewhat-homomorphic encryption with coherent states
- Computing on quantum shared secrets
- A quantum homomorphic encryption scheme for polynomial-sized circuits