Advertisement

Sampling in a Quantum Population, and Applications

  • Niek J. Bouman
  • Serge Fehr
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)

Abstract

We propose a framework for analyzing classical sampling strategies for estimating the Hamming weight of a large string from a few sample positions, when applied to a multi-qubit quantum system instead. The framework shows how to interpret the result of such a strategy and how to define its accuracy when applied to a quantum system. Furthermore, we show how the accuracy of any strategy relates to its accuracy in its classical usage, which is well understood for the important examples. We show the usefulness of our framework by using it to obtain new and simple security proofs for the following quantum-cryptographic schemes: BB84 quantum-key-distribution, and quantum oblivious-transfer from bit-commitment.

Keywords

Sampling Strategy Error Probability Security Proof Trace Distance Quantum Setting 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, pp. 175–179 (1984)Google Scholar
  2. 2.
    Bouman, N.J., Fehr, S.: Sampling in a quantum population, and applications (2009), http://arxiv.org/abs/0907.4246
  3. 3.
    Bruss, D.: Optimal eavesdropping in quantum cryptography with six states. Physical Review Letters 81, 3018 (1998), http://arxiv.org/abs/quant-ph/9805019 CrossRefGoogle Scholar
  4. 4.
    Damgård, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols via commit-and-open. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 408–427. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13–30 (1963)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Lo, H.K., Chau, H.F., Ardehali, M.: Efficient quantum key distribution scheme and a proof of its unconditional security. J. Cryptol. 18(2), 133–165 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Renner, R.: Security of Quantum Key Distribution. Ph.D. thesis, ETH Zürich (Switzerland) (September 2005), http://arxiv.org/abs/quant-ph/0512258
  8. 8.
    Renner, R.S., König, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407–425. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Shor, P.W., Preskill, J.: Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Phys. Rev. Lett. 85, 441–444 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Niek J. Bouman
    • 1
  • Serge Fehr
    • 1
  1. 1.Centrum Wiskunde & Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations