The Impossibility Of Secure Two-Party Classical Computation
Quantum Physics
2011-11-10 v2 Cryptography and Security
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.
Keywords
Cite
@article{arxiv.0708.2843,
title = {The Impossibility Of Secure Two-Party Classical Computation},
author = {Roger Colbeck},
journal= {arXiv preprint arXiv:0708.2843},
year = {2011}
}
Comments
10 pages