Comment on "Complete insecurity of quantum protocols for classical two-party computation"
Quantum Physics
2012-11-06 v1
Abstract
In a recent paper (Phys. Rev. Lett. 109, 160501 (2012). arXiv:1201.0849), it is claimed that any quantum protocol for classical two-sided computation between Alice and Bob can be proven completely insecure for Alice if it is secure against Bob. Here we show that the proof is not sufficiently general, because the security definition it based on is only a sufficient condition but not a necessary condition.
Keywords
Cite
@article{arxiv.1211.0629,
title = {Comment on "Complete insecurity of quantum protocols for classical two-party computation"},
author = {Guang Ping He},
journal= {arXiv preprint arXiv:1211.0629},
year = {2012}
}
Comments
1.5 pages. Comment on the paper PRL 109, 160501 (2012), which also appeared as arXiv:1201.0849. The locations of the original content cited in this comment are referred to those in the PRL version