Impossibility of secure two-party classical computation
Roger Colbeck · Physical Review A · 2007
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.