Impossibility of secure two-party classical computation

Roger Colbeck
Phys. Rev. A 76, 062308 – Published 13 December 2007

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

Authors & Affiliations

Roger Colbeck*

  • Centre for Quantum Computation, DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, United Kingdom
  • and Homerton College, Hills Road, Cambridge CB2 8PH, United Kingdom

  • *r.a.colbeck@damtp.cam.ac.uk

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 6 — December 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×