Impossibility of secure two-party classical computation
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.
- Publication:
-
Physical Review A
- Pub Date:
- December 2007
- DOI:
- 10.1103/PhysRevA.76.062308
- arXiv:
- arXiv:0708.2843
- Bibcode:
- 2007PhRvA..76f2308C
- Keywords:
-
- 03.67.Dd;
- Quantum cryptography;
- Quantum Physics;
- Computer Science - Cryptography and Security
- E-Print:
- 10 pages