pith. sign in

arxiv: 1609.08562 · v2 · pith:NFQNRCTDnew · submitted 2016-09-27 · 🪐 quant-ph · cs.IT· math.IT

Security of two-state and four-state practical quantum bit-commitment protocols

classification 🪐 quant-ph cs.ITmath.IT
keywords cheatingbit-commitmentfour-stateprotocolquantumtwo-stateoptimalparty
0
0 comments X
read the original abstract

We study cheating strategies against a practical four-state quantum bit-commitment protocol and its two-state variant when the underlying quantum channels are noisy and the cheating party is constrained to using single-qubit measurements only. We show that simply inferring the transmitted photons' states by using the Breidbart basis, optimal for ambiguous (minimum-error) state discrimination, does not directly produce an optimal cheating strategy for this bit-commitment protocol. We introduce a new strategy, based on certain post-measurement processes, and show it to have better chances at cheating than the direct approach. We also study to what extent sending forged geographical coordinates helps a dishonest party in breaking the binding security requirement. Finally, we investigate the impact of imperfect single-photon sources in the protocols. Our study shows that, in terms of the resources used, the four-state protocol is advantageous over the two-state version. The analysis performed can be straightforwardly generalised to any finite-qubit measurement, with the same qualitative results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.