Add to Watchlist

Complete insecurity of quantum protocols for classical two-party computation


Citation of segment
Embed Code
Purchasing a DVD Cite video

For this video, there are no automatic analysis results.

Analysis results are only provided—where legally permissible—for videos from the realms of technology/engineering, architecture, chemistry, information technology, mathematics, and physics.


Formal Metadata

Title Complete insecurity of quantum protocols for classical two-party computation
Title of Series The Annual Conference on Quantum Cryptography (QCRYPT) 2012
Number of Parts 30
Author Schaffner, Christian
Contributors Centre for Quantum Technologies (CQT)
National University of Singapore (NUS)
License CC Attribution - NonCommercial - NoDerivatives 2.5 Switzerland:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
DOI 10.5446/36657
Publisher Eidgenössische Technische Hochschule (ETH) Zürich
Release Date 2012
Language English

Content Metadata

Subject Area Information technology
Abstract A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function. In this work we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing, and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate.


AV-Portal 3.5.0 (cb7a58240982536f976b3fae0db2d7d34ae7e46b)


  266 ms - page object