The Impossibility Of Secure Two-Party Classical Computation

Roger Colbeck

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.

Knowledge Graph



Sign up or login to leave a comment