dorsal/arxiv
View SchemaAn introduction to quantum coin-tossing
| Authors | C. Doescher, M. Keyl |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0206088 |
| URL | https://arxiv.org/abs/quant-ph/0206088 |
Abstract
We review the quantum version of a well known problem of cryptography called coin tossing (``flipping a coin via telephone''). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly distributed random bit which is common to both parties. The only resource they can use to perform this task is a classical or quantum communication channel. In this paper we provide a general overview over such coin tossing protocols, concerning in particular their security.
{
"annotation_id": "3f64002d-e1d2-49f1-b29a-9599592f5a12",
"date_created": "2026-03-02T18:01:51.842000Z",
"date_modified": "2026-03-02T18:01:51.842000Z",
"file_hash": "719262c674b12a6edb056aa73b2f36be19b661c2b9f445cdc0b960a8ffefc774",
"private": false,
"record": {
"abstract": "We review the quantum version of a well known problem of cryptography called\ncoin tossing (``flipping a coin via telephone\u0027\u0027). It can be regarded as a game\nwhere two remote players (who distrust each other) tries to generate a\nuniformly distributed random bit which is common to both parties. The only\nresource they can use to perform this task is a classical or quantum\ncommunication channel. In this paper we provide a general overview over such\ncoin tossing protocols, concerning in particular their security.",
"arxiv_id": "quant-ph/0206088",
"authors": [
"C. Doescher",
"M. Keyl"
],
"categories": [
"quant-ph"
],
"title": "An introduction to quantum coin-tossing",
"url": "https://arxiv.org/abs/quant-ph/0206088"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6530b966-daf3-4cb5-b50c-f0857beefcfb",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}