Quantum preprocessing for information-theoretic security in two-party computation
share
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. For the security level to be interesting for secure two-party computation, it suffices to require that one particular party is conservative, meaning that he values the privacy of his data higher than the learning of the other party's data, or to require that the other party is honest-but-curious. We show that the security is usually dependent on the noise level, but not for some party in one of the protocols. 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.
READ FULL TEXT