dorsal/arxiv
View SchemaUnconditional security in quantum bit commitment
| Authors | Horace P. Yuen |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0106001 |
| URL | https://arxiv.org/abs/quant-ph/0106001 |
Abstract
The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found. An unconditionally secure bit commitment protocol utilizing anonymous quantum states and the no-clone theorem is presented below with a full security proof.
{
"annotation_id": "910407f1-cdfc-4847-bb3f-8bf306cdef13",
"date_created": "2026-03-02T18:01:45.507000Z",
"date_modified": "2026-03-02T18:01:45.507000Z",
"file_hash": "c206d7b9f49b7af89d5c277109c206521fc6c9e8c1c59bfc4ab7de30fa5a9e34",
"private": false,
"record": {
"abstract": "The commitment of bits between two mutually distrustful parties is a powerful\ncryptographic primitive with which many cryptographic objectives can be\nachieved. It is widely believed that unconditionally secure quantum bit\ncommitment is impossible due to quantum entanglement cheating, which is\ncodified in a general impossibility theorem. Gaps in the proof of this\nimpossibility theorem are found. An unconditionally secure bit commitment\nprotocol utilizing anonymous quantum states and the no-clone theorem is\npresented below with a full security proof.",
"arxiv_id": "quant-ph/0106001",
"authors": [
"Horace P. Yuen"
],
"categories": [
"quant-ph"
],
"title": "Unconditional security in quantum bit commitment",
"url": "https://arxiv.org/abs/quant-ph/0106001"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a7e7cd27-1f7a-4834-9034-03aeaf4c1626",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}