Impossibility of secure two-party classical computation
Journal Article
·
· Physical Review. A
- Centre for Quantum Computation, DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom)
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.
- OSTI ID:
- 21140623
- Journal Information:
- Physical Review. A, Journal Name: Physical Review. A Journal Issue: 6 Vol. 76; ISSN 1050-2947; ISSN PLRAAN
- Country of Publication:
- United States
- Language:
- English
Similar Records
Proposal for founding mistrustful quantum cryptography on coin tossing
Implementation of two-party protocols in the noisy-storage model
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
Journal Article
·
Tue Jul 01 00:00:00 EDT 2003
· Physical Review. A
·
OSTI ID:20639878
Implementation of two-party protocols in the noisy-storage model
Journal Article
·
Sat May 15 00:00:00 EDT 2010
· Physical Review. A
·
OSTI ID:21413371
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
Journal Article
·
Wed Sep 15 00:00:00 EDT 2010
· Physical Review. A
·
OSTI ID:21448647