Skip to main content
SpringerLink
Log in

Quantum cryptography beyond key exchange

  • Reguläre Beiträge
  • Published:
Informatik - Forschung und Entwicklung

Abstract

This chapter describes the applicability of quantum cryptography beyond key exchange. The section is devided into two parts: one describing applications of quantum cryptography different from key exchange and the other considering countermeasures to additional threats like coercibility or traffic analysis.

Every section ends with a short summary or an appraisal in boldface and in the conclusions all topics of this section are briefly outlined and in an outlook we give a personal statement about the relevance of quantum cryptographic pro tocols and promising future directions of research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aschauer H, Briegel H-J (2002) Private entanglement over arbitrary distances, even using a noisy apparatus. Phys Rev Lett 88:047902

    Article  Google Scholar 

  2. Ambainis A, Buhrman H, Dodis Y, Röhrig H (2004) Multiparty quantum coin flipping. In: IEEE Conference on Computational Complexity (CCC 2004), IEEE Computer Society, Amherst, MA, USA, pp 250–259

  3. Ambainis A (2001) A new protocol, lower bounds for quantum coin flipping. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing STOC, ACM, pp 134–142

  4. Arrighi P, Salvail L (2003) Blind quantum computation. Appeared as Los Alamos. preprint quant-ph/0309152, September 2003

  5. Aharonov D, Ta-Shma A, Vazirani UV, Yao AC (2000) Quantum bit escrow. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing. ACM, Portland, Oregon, United States, May 2000, pp 705–714

  6. Bennett CH, Brassard G, Crépeau C, Skubiszewska M-H (1992) Practical quantum oblivious transfer. In: Advances in Cryptology – CRYPTO ’91, Lecture Notes in Computer Science, vol 576. Springer, Santa Barbara, California, USA, pp 351–366

  7. Brassard G, Crepeau C, Jozsa R, Langlois D (1993) A quantum bit commitment scheme provably unbreakable by both parties. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp 362–371

  8. Brassard G, Crepeau C, Mayers D, Salvail L (1997) A brief review of the impossibility of quantum bit commitment. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9712023, December 1997

  9. Brassard G, Crepeau C, Mayers D, Salvail L (1998) Defeating classical bit commitments with a quantum computer. Available as Los Alamos preprint quant-ph/9806031, June 1998

  10. Beaver D (2002) On deniability in quantum key exchange. In: Advances in Cryptology - EUROCRYPT 2002, Lecture Notes in Computer Science, vol 2332, Springer, Amsterdam, The Netherlands, April 2002, pp 352–367

  11. Blum M (1982) Coin flipping by telephone. In: Advances in Cryptology: A Report on CRYPTO 81, ECE Report 82(04):11–15, August 1982

  12. Barrett J, Massar S (2004) Quantum coin tossing and bit-string generation in the presence of noise. Phys Rev A 69:022322

    Article  Google Scholar 

  13. Beth T, Müller-Quade J, Steinwandt R (2005) Cryptanalysis of a practical quantum key distribution with polarization-entangled photons. Quantum Inf Comput 5(3):69–80

    MathSciNet  Google Scholar 

  14. Ben-Or M, Goldwasser S, Wigderson A (1988) Completeness theorems for non-cryptographic fault tolerant distributed computation. In: STOC ’88: Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM Press, pp 1–10

  15. Ben-Or M, Horodecki M, Leung D, Mayers D, Oppenheim J (2004) The universal composable security of quantum key distribution. Theory of Cryptography Conference 2005, preprint on quant-ph/0409078

  16. Ben-Or M, Mayers D (2004) General security definition and composability for quantum & classical protocols. Online at http://xxx.lanl.gov/abs/quant-ph/0409062, September 2004

  17. Canetti R (2001) Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001. IEEE Computer Society, pp 136–145

  18. Chaum D, Crepeau C, Damgaard I (1988) Multiparty unconditionally secure protocols. In: Proceedings of the 19th STOC, ACM, pp 11–19

  19. Cachin C, Crepeau C, Marcil J (1998) Oblivious transfer with a memory-bounded receiver. In: FOCS ’98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, p 493

  20. Canetti R, Fischlin M (2001) Universally composable commitments. In: CRYPTO ’01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag, pp 19–40

  21. Crepeau C, Kilian J (1988) Achieving oblivious transfer using weakened security assumptions. In: FOCS ’88: Proceedings of the 29th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, pp 42–52

  22. Cachin C, Maurer UM (1997) Unconditional security against memory-bounded adversaries. In: Advances in Cryptology – CRYPTO ’97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17–21, 1997, Proceedings, Lecture Notes in Computer Science, vol 1294, Springer, pp 292–306

  23. Chaum D, Roijakkers S (1990) Unconditionally secure digital signatures. In: Menezes AJ, Vanstone SA (eds) Advances in Cryptology: Crypto ’90, LNCS, vol 537, Springer-Verlag, pp 206–215

  24. Crépeau C (1988) Equivalence between two flavours of oblivious transfers. In: Advances in Cryptology – CRYPTO ’87, Lecture Notes in Computer Science, vol 293, Santa Barbara, California, USA, August 1988. Springer, pp 350–354

  25. Crepeau C, van de Graaf J, Tapp A (1995) Committed oblivious transfer and private multi-party computations. In: Advances in Cryptology: Proceedings of Crypto ‘95. Springer, pp 110–123

  26. Carter J, Wegman M (1979) New hash functions and their use in authentication and set equality. J Comput Syst Sci 22:265–279

    MathSciNet  Google Scholar 

  27. Carter J, Wegman M (1979) Universal classes of hash functions. J Comput Syst Sci 18:143–154

    Article  MATH  MathSciNet  Google Scholar 

  28. Dolev D, Dwork C, Naor M (1991) Non-malleable cryptography. In: STOC ’91: Proceedings of the twenty-third annual ACM symposium on Theory of computing. ACM Press, pp 542–552

  29. Damgard I, Fehr S, Salvail L (2004) Zero-knowledge proofs and string commitments withstanding quantum attacks. In: Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science. Springer, Santa Barbara, California, USA pp 254–272

  30. Damgard I, Fehr S, Salvail L, Schaffner C (2005) Cryptography in the bounded quantum-storage model. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Proceedings IEEE Computer Society, 23–25 October 2005, Pittsburgh, PA, USA, pp 449–458

  31. Dumais P, Mayers D, Salvail L (2000) Perfectly concealing quantum bit commitment from any quantum one-way function. In: Preneel B (ed) Advances in Cryptography – EUROCRYPT 2000, Lecture Notes in Computer Science, vol 1807, Springer, Brugge, Belgium

  32. Dwork C, Naor M, Sahai A (1998) Concurrent zero-knowledge. In: STOC ’98: Proceedings of the thirtieth annual ACM symposium on Theory of computing. ACM Press, pp 409–418

  33. Gottesman D, Chuang I ( 2001) Quantum digital signatures. Appeared as Los Alamos preprint quant-ph/0105032, May 2001

  34. Goldwasser S, Micali S, Rackoff C (1985) The knowledge complexity of interactive proof-systems (extended abstract). In: Proceedings of STOC ’85. ACM Press, May 1985, pp 291–304

  35. Goldreich O, Micali S, Wigderson A (1987) How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of STOC ’87. ACM Press, pp 218–229

  36. Goldreich O (2002) Zero-knowledge twenty years after its invention. Electronic Colloquium on Computational Complexity (ECCC), 063

  37. Gruska J (1999) Quantum Computing. Advanced Topics in Computer Science. Mc Graw Hill, London

    Google Scholar 

  38. Hughston LP, Jozsa R, Wootters WK (1993) A complete classification of quantum ensembles having a give density matrix. Phys Lett A 183:14–18

    Article  MathSciNet  Google Scholar 

  39. Hardy L, Kent A (2004) Cheat sensitive quantum bit commitment. Phys Rev Lett 92:157901 Online available as Los Alamos preprint quant-ph/9911043

    Article  Google Scholar 

  40. Hofheinz D, Müller-Quade J (2003) A paradox of quantum universal composability. Poster at the 4th European QIPC Workshop Abstract available at http://www.quiprocone.org/Oxford/Abstracts.htm#POSTERS

  41. Hofheinz D, Müller-Quade J (2004) A synchronous model for multi-party computation and the incompleteness of oblivious transfer. In: Sabelfeld A (ed) Proceedings of FCS 2004. pp 117–130, Turku Centre for Computer Science. TUCS General Publications. LICS ’04 and ICALP ’04 Affiliated Workshop on Foundations of Computer Security

  42. Hofheinz D, Müller-Quade J, Unruh D (2006) On the (im-)possibility of extending coin toss. In: Advances in Cryptology, Proceedings of EUROCRYPT ’06, Lecture Notes in Computer Science, vol 4004, Springer, preprint on IACR ePrint 2006/177, pp 504–521

  43. Kent A (1999) Secure classical bit commitment using fixed capacity communication channels. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9906103, June 1999

  44. Kent A (1999) Unconditionally secure bit commitment. Phys Rev Lett 83:1447–1450. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9810068

    Google Scholar 

  45. Kent A (2000) Impossibility of unconditionally secure commitment of a certified classical bit. Phys Rev A 61(4):042301

    Article  MathSciNet  Google Scholar 

  46. Kilian J (1988) Founding cryptography on oblivious transfer. In: Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), ACM, Chicago, pp 20–31

  47. Lo H-K, Chau HF (1997) Why quantum bit commitment and ideal quantum coin tossing are impossible. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9711065, November 1997, a previous version was published at PhysComp96

  48. Lindell Y, Lysyanskaya A, Rabin T (2002) On the composition of authenticated byzantine agreement. In: STOC ’02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, ACM Press, pp 514–523

  49. Lo H-K (1997) Insecurity of quantum secure computations. Phys Rev A 56:1154–1162 Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9611031

    Article  Google Scholar 

  50. Mayers D (1996) Quantum key distribution and string oblivious transfer in noisy channels. In: Proceedings of Crypto’96, Lecture Notes in Computer Science, Springer Verlag, Santa Barbara, pp 2–7

  51. Mayers D (1996) The trouble with bit commitment. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9603015

  52. Mayers D (1996) Unconditionally secure quantum bit commitment is impossible. Available on the Los Alamos preprint archieve at xxx.lanl.gov as quant-ph/9712023

  53. Mayers D (1997) Unconditionally secure bit commitment is impossible. Phys Rev Lett 78:3414–3417

    Article  Google Scholar 

  54. Mochon C (2004) Quantum weak coin-flipping with bias of 0.192. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), IEEE Computer Society, October 2004, pp 2–11

  55. Müller-Quade J (2002) Quantumpseudosignatures. J Mod Opt 49(8):1269–1276, July 2002

    Article  Google Scholar 

  56. Müller-Quade J, Steinwandt R (2003) On the problem of authentication in a quantum protocol to detect traffic analysis. Quantum Inf Comput 3(1):48–54

    MathSciNet  Google Scholar 

  57. Nishioka T, Hanaoka G, Imai H (1999) A new digital signature scheme on id-based key sharing infrastructures. In: Proc. of 1999 International Information Security Workshop (ISW’99), LNCS, vol 1729, Springer-Verlag, Kuala Lumpur, Malaysia, pp 259–270

  58. Okamoto T, Tanaka K, Uchiyama S (2000) Quantum public-key cryptosystems. In: Advances in Cryptology - CRYPTO 2000, Lecture Notes in Computer Science, vol 1880, Springer, Santa Barbara, California, USA, pp 147–165

  59. Pfitzmann B, Waidner A (1992) Unconditional byzantine agreement for any number of faulty processors. In: Proc. STACS’92, LNCS, vol 577, Springer-Verlag, pp 339–350

  60. Pfitzmann B, Waidner M (2001) A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy. pp 184–200

  61. Rabin T, Ben-Or M (1989) Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC 1989, ACM, pp 73–85

  62. Renner R, Koenig R (2004) Universally composable privacy amplification against quantum adversaries. Online at http://xxx.lanl.gov/abs/quant-ph/0403133, March 2004

  63. Raub D, Steinwandt R, Müller-Quade J (2005) On the security and composability of the one time pad. In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, vol 3381, Springer, pp 288–297

  64. Salvail L (1998) Quantum bit commitment from a physical assumption. In: Proceedings of Crypto’98, Lecture Notes in Computer Science, vol 1462, Springer Verlag, Santa Barbara, pp 338–353

  65. Steinwandt R, Janzing D, Beth T (2001) On using quantum protocols to detect traffic analysis. Quantum Inf Comput 1(3):62–69

    MathSciNet  Google Scholar 

  66. Shor P, Preskill J (2000) Simple proof of security of the bb84 quantum key distribution protocol. Phys Rev Lett 85:441–444

    Article  Google Scholar 

  67. Unruh D (2004) Relating formal security for classical and quantum protocols. Invited Talk at the Workshop on Quantum Information Science, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, September 2004

  68. Unruh D (2004) Simulatable security for quantum protocols, preprint on quant-ph/0409125, September 2004

  69. Yao A (1982) Protocols for secure computations (extended abstract). In: 23rd Symp on Foundations of Computer Science (FOCS), IEEE, pp 160–164

  70. Yao A (1995) Security of quantum protocols against coherent measurements. In: Procedings of the 27th Symposium on the Theory of Computing, ACM, Las Vegas, June 1995, pp 67–75

  71. Yuen H (2003) How to build unconditionally secure quantum bit commitment protocols. Available as Los Alamos preprint quant-ph/0305144, May 2003

Download references

Author information

Authors and Affiliations

  1. E.I.S.S., Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany

    Jörn Müller-Quade

Authors
  1. Jörn Müller-Quade
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jörn Müller-Quade.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Müller-Quade, J. Quantum cryptography beyond key exchange . Informatik Forsch. Entw. 21, 39–54 (2006). https://doi.org/10.1007/s00450-006-0011-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00450-006-0011-z

Keywords

Search

Navigation