NewEvery arXiv paper, its researchers & institutions — mapped.
paper

The Impossibility Of Secure Two-Party Classical Computation

arXiv:0708.2843 · doi:10.1103/PhysRevA.76.062308

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.

10 pages