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.
- Received 23 August 2007
DOI:https://doi.org/10.1103/PhysRevA.76.062308
©2007 American Physical Society