Secure Controlled Teleportation
| dc.creator | Kenigsberg, Dan | |
| dc.creator | Mor, Tal | |
| dc.date | 2006-09-05 | |
| dc.date.accessioned | 2026-07-07T07:51:31Z | |
| dc.date.available | 2026-07-07T07:51:31Z | |
| dc.description | Several protocols for controlled teleportation were suggested by Yang, Chu, and Han [PRA 70, 022329 (2004)]. In these protocols, Alice teleports qubits (in an unknown state) to Bob iff a controller allows it. We view this problem in the perspective of secure multi-party quantum computation. We show that the suggested entanglement-efficient protocols for $m$-qubit controlled teleportation are open to cheating; Alice and Bob may teleport $(m-1)$-qubits of quantum information, out of the controllers' control. We conjecture that the straightforward protocol for controlled teleportation, which requires each controller to hold $m$ entangled qubits, is optimal. We prove this conjecture for a limited, but interesting, subset of protocols. | |
| dc.description | 3 pages, presented as a poster in AQIS'06, where A. Winter suggested considerable improvements to the main result (these suggestions are not included in this version) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0609028 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0609028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/125540 | |
| dc.subject | Quantum Physics | |
| dc.subject | Cryptography and Security | |
| dc.title | Secure Controlled Teleportation | |
| dc.type | text |