dorsal/arxiv
View SchemaUpper bounds of eavesdropper's performances in finite-length code with decoy method
| Authors | Masahito Hayashi |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0702250 |
| URL | https://arxiv.org/abs/quant-ph/0702250 |
| DOI | 10.1103/PhysRevA.76.012329 |
| Journal | Physical Review A, 76, 012329 (2007) |
Abstract
Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in presence of dark counts with that without.
{
"annotation_id": "897d2734-3e41-4d9a-9bee-c4f5b761579a",
"date_created": "2026-03-02T18:02:33.711000Z",
"date_modified": "2026-03-02T18:02:33.711000Z",
"file_hash": "17dcc1166c9e2482a78f2969827ed1a36a10449985f001e72bf3cf0c8b038874",
"private": false,
"record": {
"abstract": "Security formulas of quantum key distribution (QKD) with imperfect resources\nare obtained for finite-length code when the decoy method is applied. This\nanalysis is useful for guaranteeing the security of implemented QKD systems.\nOur formulas take into account the effect of the vacuum state and dark counts\nin the detector. We compare the asymptotic key generation rate in presence of\ndark counts with that without.",
"arxiv_id": "quant-ph/0702250",
"authors": [
"Masahito Hayashi"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.76.012329",
"journal_ref": "Physical Review A, 76, 012329 (2007)",
"title": "Upper bounds of eavesdropper\u0027s performances in finite-length code with decoy method",
"url": "https://arxiv.org/abs/quant-ph/0702250"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "356afe16-7fcb-45e8-b838-d6923e43638c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}