Erasable Bit Commitment from Temporary Quantum Trust
arXiv:1910.13949 · doi:10.1109/JSAIT.2020.3017054
Abstract
We introduce a new setting for two-party cryptography with temporarily trusted third parties. In addition to Alice and Bob in this setting, there are additional third parties, which Alice and Bob both trust to be honest during the protocol. However, once the protocol concludes, there is no guarantee over the behaviour of these third parties. It is possible that they collaborate and act adversarially. Our goal is to use these third parties to facilitate protocols which are impossible in two-party cryptography. We implement a variant of bit commitment in this setting, which we call erasable bit commitment. In this primitive, Alice has the choice of either opening or erasing her commitment after the commit phase. The ability to ask for an erasure allows Alice to ask the trusted parties to erase her commitment in case the trust period is about to expire. This erasure prevents a future coalition of the third parties and Bob from extracting any information about the commitment. However, this ability also makes erasable bit commitment weaker than the standard version of bit commitment. In addition to satisfying the security requirements of bit commitment, our protocol also does not reveal any information about the commitment to the third parties. Lastly, our protocol for this primitive requires a constant number of trusted third parties and can tolerate a small number of corrupt trusted parties as well as implementation errors.
References in corpus (21)
- Unconditionally secure quantum bit commitment is impossible
- Tight Finite-Key Analysis for Quantum Cryptography
- Is Quantum Bit Commitment Really Possible?
- The Uncertainty Relation for Smooth Entropies
- Unconditionally Secure Bit Commitment
- Unconditional security from noisy quantum storage
- Cryptography from Noisy Storage
- One-shot decoupling
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Chain Rules for Smooth Min- and Max-Entropies
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Cheat Sensitive Quantum Bit Commitment
- Quantum one-time programs
- Unconditionally Secure Bit Commitment with Flying Qudits
- Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment
- Secure two-party quantum evaluation of unitaries against specious adversaries
- Secure bit commitment from relativistic constraints
- Impossibility of Growing Quantum Bit Commitments
- A brief review on the impossibility of quantum bit commitment
- Security bound of cheat sensitive quantum bit commitment
- Proving Erasure