QUANT-PHCRApr 3, 2015

Deterministic Relativistic Quantum Bit Commitment

arXiv:1504.00943v118 citations
Originality Incremental advance
AI Analysis

This work addresses secure communication for quantum cryptography, offering deterministic or low-randomness schemes that are incremental improvements over existing quantum protocols.

The paper tackles the problem of secure bit commitment by introducing new schemes based on Minkowski causality and quantum entanglement monogamy, achieving near-perfect security against losses and errors, with perfect security possible using an extra random bit.

We describe new unconditionally secure bit commitment schemes whose security is based on Minkowski causality and the monogamy of quantum entanglement. We first describe an ideal scheme that is purely deterministic, in the sense that neither party needs to generate any secret randomness at any stage. We also describe a variant that allows the committer to proceed deterministically, requires only local randomness generation from the receiver, and allows the commitment to be verified in the neighbourhood of the unveiling point. We show that these schemes still offer near-perfect security in the presence of losses and errors, which can be made perfect if the committer uses an extra single random secret bit. We discuss scenarios where these advantages are significant.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes