Compare Papers
Paper 1
Blind information reconciliation with polar codes for quantum key distribution
E. O. Kiktenko, A. O. Malyshev, A. K. Fedorov
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2008.12299
- arXiv
- 2008.12299
We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes. We show that the suggested protocol outperforms the blind reconciliation with LDPC codes, especially when there are high fluctuations in quantum bit error rate (QBER).
Open paperPaper 2
Security bound of cheat sensitive quantum bit commitment
Guang Ping He
- Year
- 2014
- Journal
- arXiv preprint
- DOI
- arXiv:1407.7517
- arXiv
- 1407.7517
Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the sender's committed bit before it is unveiled, while his cheating can pass the security check with a probability not less than 50%. The sender's cheating is also studied. The optimal CSQBC protocols that can minimize the sum of the cheating probabilities of both parties are found to be trivial, as they are practically useless. We also discuss the possibility of building a fair protocol in which both parties can cheat with equal probabilities.
Open paper