The Impossibility Of Secure Two-Party Classical Computation

Roger Colbeck

Published 2007-08-21, updated 2007-12-14Version 2

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.