Volume

Dagstuhl Seminar Proceedings, Volume 9311

Publication Details

  • published at: 2010-01-06
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.09311.1
09311 Abstracts Collection – Classical and Quantum Information Assurance Foundations and Practice

Authors: Samuel L. Braunstein, Hoi-Kwong Lo, Kenny Paterson, and Peter Y. A. Ryan

Abstract
From 26 July 2009 to 31 July 2009, the Dagstuhl Seminar 09311 ``Classical and Quantum Information Assurance Foundations and Practice'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. The workshop was intended to explore the latest developments and discuss the open issues in the theory and practice of classical and quantum information assurance. A further goal of the workshop was to bring together practitioners from both the classical and the quantum information assurance communities. To date, with a few exceptions, these two communities seem to have existed largely separately and in a state of mutual ignorance. It is clear however that there is great potential for synergy and cross-fertilization between and this we sought to stimulate and facilitate.
Cite as

Samuel L. Braunstein, Hoi-Kwong Lo, Kenny Paterson, and Peter Y. A. Ryan. 09311 Abstracts Collection – Classical and Quantum Information Assurance Foundations and Practice. In Classical and Quantum Information Assurance Foundations and Practice. Dagstuhl Seminar Proceedings, Volume 9311, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{braunstein_et_al:DagSemProc.09311.1,
  author =	{Braunstein, Samuel L. and Lo, Hoi-Kwong and Paterson, Kenny and Ryan, Peter Y. A.},
  title =	{{09311 Abstracts Collection – Classical and Quantum Information Assurance Foundations and Practice}},
  booktitle =	{Classical and Quantum Information Assurance Foundations and Practice},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9311},
  editor =	{Samual L. Braunstein and Hoi-Kwong Lo and Kenny Paterson and Peter Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09311.1},
  URN =		{urn:nbn:de:0030-drops-23658},
  doi =		{10.4230/DagSemProc.09311.1},
  annote =	{Keywords: Quantum Information assurance, classical information assurance, cryptography, quantum computation}
}
Document
DOI: 10.4230/DagSemProc.09311.2
Geometry of abstraction in quantum computation

Authors: Dusko Pavlovic

Abstract
Modern cryptography is based on various assumptions about computational hardness and feasibility. But while computability is a very robust notion (cf Church's Thesis), feasibility seems quite sensitive to the available computational resources. A prime example are, of course, quantum channels, which provide feasible solutions of some otherwise hard problems; but ants' pheromones, used as a computational resource, also provide feasible solutions of other hard problems. So at least in principle, modern cryptography is concerned with the power and availability of computational resources. The standard models, used in cryptography and in quantum computation, leave a lot to be desired in this respect. They do, of course, support many interesting solutions of deep problems; but besides the fundamental computational structures, they also capture some low level features of particular implementations. In technical terms of program semantics, our standard models are not *fully abstract*. (Related objections can be traced back to von Neumann's "I don't believe in Hilbert spaces" letters from 1937.) I shall report on some explorations towards extending the modeling tools of program semantics to develop a geometric language for quantum protocols and algorithms. Besides hiding the irrelevant implementation details, its abstract descriptions can also be used to explore simple nonstandard models. If the time permits, I shall describe a method to implement teleportation, as well as the hidden subgroup algorithms, using just abelian groups and relations.
Cite as

Dusko Pavlovic. Geometry of abstraction in quantum computation. In Classical and Quantum Information Assurance Foundations and Practice. Dagstuhl Seminar Proceedings, Volume 9311, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{pavlovic:DagSemProc.09311.2,
  author =	{Pavlovic, Dusko},
  title =	{{Geometry of abstraction in quantum computation}},
  booktitle =	{Classical and Quantum Information Assurance Foundations and Practice},
  pages =	{1--28},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9311},
  editor =	{Samual L. Braunstein and Hoi-Kwong Lo and Kenny Paterson and Peter Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09311.2},
  URN =		{urn:nbn:de:0030-drops-23623},
  doi =		{10.4230/DagSemProc.09311.2},
  annote =	{Keywords: Quantum algorithms, categorical semantics, Frobenius algebra, classical structure}
}
Document
DOI: 10.4230/DagSemProc.09311.3
Quantum key distribution and cryptography: a survey

Authors: Romain Alléaume, Norbert Lütkenhaus, Renato Renner, Philippe Grangier, Thierry Debuisschert, Gregoire Ribordy, Nicolas Gisin, Philippe Painchault, Thomas Pornin, Louis Slavail, Michel Riguidel, Andrew Shilds, Thomas Länger, Momtchil Peev, Mehrdad Dianati, Anthony Leverrier, Andreas Poppe, Jan Bouda, Cyril Branciard, Mark Godfrey, John Rarity, Harald Weinfurter, Anton Zeilinger, and Christian Monyk

Abstract
I will try to partially answer, based on a review on recent work, the following question: Can QKD and more generally quantum information be useful to cover some practical security requirements in current (and future) IT infrastructures ? I will in particular cover the following topics - practical performances of QKD - QKD network deployment - SECOQC project - Capabilities of QKD as a cryptographic primitive - comparative advantage with other solution, in order to cover practical security requirements - Quantum information and Side-channels - QKD security assurance - Thoughts about "real" Post-Quantum Cryptography
Cite as

Romain Alléaume, Norbert Lütkenhaus, Renato Renner, Philippe Grangier, Thierry Debuisschert, Gregoire Ribordy, Nicolas Gisin, Philippe Painchault, Thomas Pornin, Louis Slavail, Michel Riguidel, Andrew Shilds, Thomas Länger, Momtchil Peev, Mehrdad Dianati, Anthony Leverrier, Andreas Poppe, Jan Bouda, Cyril Branciard, Mark Godfrey, John Rarity, Harald Weinfurter, Anton Zeilinger, and Christian Monyk. Quantum key distribution and cryptography: a survey. In Classical and Quantum Information Assurance Foundations and Practice. Dagstuhl Seminar Proceedings, Volume 9311, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{alleaume_et_al:DagSemProc.09311.3,
  author =	{All\'{e}aume, Romain and L\"{u}tkenhaus, Norbert and Renner, Renato and Grangier, Philippe and Debuisschert, Thierry and Ribordy, Gregoire and Gisin, Nicolas and Painchault, Philippe and Pornin, Thomas and Slavail, Louis and Riguidel, Michel and Shilds, Andrew and L\"{a}nger, Thomas and Peev, Momtchil and Dianati, Mehrdad and Leverrier, Anthony and Poppe, Andreas and Bouda, Jan and Branciard, Cyril and Godfrey, Mark and Rarity, John and Weinfurter, Harald and Zeilinger, Anton and Monyk, Christian},
  title =	{{Quantum key distribution and cryptography: a survey}},
  booktitle =	{Classical and Quantum Information Assurance Foundations and Practice},
  pages =	{1--29},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9311},
  editor =	{Samual L. Braunstein and Hoi-Kwong Lo and Kenny Paterson and Peter Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09311.3},
  URN =		{urn:nbn:de:0030-drops-23618},
  doi =		{10.4230/DagSemProc.09311.3},
  annote =	{Keywords: QKD, QKD networks, Security assurance, Post-Quantum Cryptography}
}

Filters

  • Authors
  • A
  • Alléaume, Romain
  • B
  • Bouda, Jan
  • Branciard, Cyril
  • Braunstein, Samuel L.
  • D
  • Debuisschert, Thierry
  • Dianati, Mehrdad
  • G
  • Gisin, Nicolas
  • Godfrey, Mark
  • Grangier, Philippe
  • L
  • Länger, Thomas
  • Leverrier, Anthony
  • Lo, Hoi-Kwong
  • Lütkenhaus, Norbert
  • M
  • Monyk, Christian
  • P
  • Painchault, Philippe
  • Paterson, Kenny
  • Pavlovic, Dusko
  • Peev, Momtchil
  • Poppe, Andreas
  • Pornin, Thomas
  • R
  • Rarity, John
  • Renner, Renato
  • Ribordy, Gregoire
  • Riguidel, Michel
  • Ryan, Peter Y. A.
  • S
  • Shilds, Andrew
  • Slavail, Louis
  • W
  • Weinfurter, Harald
  • Z
  • Zeilinger, Anton

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact