Asymmetric “4+2” protocol for quantum key distribution with finite resources

Asymmetric “4+2” protocol for quantum key distribution with finite resources In this paper, we present an asymmetric “4+2” protocol for quantum key distribution with finite photon pulses. The main work of this paper focuses on the composable security proof for this protocol in a finite-key scenario. Based on the essence security basis of the original “4+2” protocol proposed by Huttner et al. (Phys Rev A 51(3):1863–1869, 1995), we first develop the squashing model for this protocol with the quantum non-demolition measure theory. From this model, against the collective photon-number-splitting attack, we then provide the security proof (formulas of finite-key security bounds) for this protocol. The expected performance of this protocol are also evaluated on a priori reasonable expected values of parameters. Our work shows that the performance we derived is the lower one and it can cover long distances in the lossy channel. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Asymmetric “4+2” protocol for quantum key distribution with finite resources

Loading next page...
 
/lp/springer_journal/asymmetric-4-2-protocol-for-quantum-key-distribution-with-finite-nd4ZFixy0A
Publisher
Springer US
Copyright
Copyright © 2013 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-013-0684-8
Publisher site
See Article on Publisher Site

Abstract

In this paper, we present an asymmetric “4+2” protocol for quantum key distribution with finite photon pulses. The main work of this paper focuses on the composable security proof for this protocol in a finite-key scenario. Based on the essence security basis of the original “4+2” protocol proposed by Huttner et al. (Phys Rev A 51(3):1863–1869, 1995), we first develop the squashing model for this protocol with the quantum non-demolition measure theory. From this model, against the collective photon-number-splitting attack, we then provide the security proof (formulas of finite-key security bounds) for this protocol. The expected performance of this protocol are also evaluated on a priori reasonable expected values of parameters. Our work shows that the performance we derived is the lower one and it can cover long distances in the lossy channel.

Journal

Quantum Information ProcessingSpringer Journals

Published: Nov 17, 2013

References

  • Unconditional security of the Bennett 1992 quantum key-distribution scheme with strong reference pulse
    Tamaki, K; Lütkenhaus, N; Koashi, M; Batuwantu-dawe, J

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off