The Impossibility Of Secure Two-Party Classical Computation

TL;DR

This paper demonstrates that unconditionally secure two-party classical computation cannot be achieved for many functions, including oblivious transfer, across quantum and relativistic protocols, highlighting fundamental limitations.

Contribution

It provides a comprehensive proof of the impossibility of secure two-party classical computation for a broad class of functions, extending to quantum and relativistic settings.

Findings

Unconditional security in two-party classical computation is impossible for many functions.

The results apply to both quantum and relativistic protocols.

Oblivious transfer cannot be securely implemented under these conditions.

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.