id: 05194678
dt: a
an: 05194678
au: Gilbert, G.; Hamrick, M.; Thayer, F.J.
ti: Practical quantum cryptography: secrecy capacity and privacy amplification.
so: Sergienko, Alexander V. (ed.), Quantum communications and cryptography.
    Boca Raton, FL: CRC Press; Boca Raton, FL: Taylor \& Francis (ISBN
    978-0-8493-3684-3/hbk). 145-162 (2006).
py: 2006
pu: Boca Raton, FL: CRC Press; Boca Raton, FL: Taylor \& Francis
la: EN
cc: 
ut: 
ci: Zbl 1012.68063; Zbl 0969.94501
li: 
ab: From the introduction: Our analysis of the secrecy of a practical
    implementation of the BB84 protocol simultaneously takes into account
    and presents the full set of analytical expressions for effects due to
    the presence of pulses containing multiple photons in the attenuated
    output of the laser, the finite length of individual blocks of key
    material, losses due to error correction, privacy amplification, and
    authentication, errors in polarization detection, the efficiency of the
    detectors, and attenuation processes in the transmission medium [the
    first two authors, “Practical quantum cryptography: a comprehensive
    analysis (part one)”, arXiv quant-ph/0009027 (2000); Algorithmica 34,
    No. 4, 314‒339 (2002; Zbl 1012.68063)].  We consider particular
    attacks made on individual photons, as opposed to collective attacks on
    the full quantum state of the photon pulses. The extension to other
    protocols, such as B92 [{\it C.~H. Bennett}, Phys. Rev. Lett. 68, No.
    21, 3121‒3124 (1992; Zbl 0969.94501)] is straightforward, but is not
    discussed here because of limitations of space. We analyze important
    subtleties that arise in the practical implementation of privacy
    amplification in which the distinction between averaging over hash
    functions, on the one hand, and making use of a particular hash
    function, on the other, yield different bounds on the mutual
    information available to an enemy eavesdropper. We pay special
    attention to the consequences of this distinction on the resulting
    throughput of secret bits, which is a crucial figure-of-merit in
    assessing the viability of a practical key distribution system.  [
rv: