September 18 – 23 , 2011, Dagstuhl Seminar 11381
Serge Fehr (CWI – Amsterdam, NL)
Michele Mosca (University of Waterloo, CA)
Martin Roetteler (NEC Laboratories America, Inc. – Princeton, US)
Rainer Steinwandt (Florida Atlantic University – Boca Raton, US)
For support, please contact
A total of 41 scientists from across the world, including both young and senior researchers, visited Dagstuhl for this seminar. To ensure fruitful discussions between experts in quantum computing and in cryptography, the invited participants were chosen such that there is enough common ground/research experience to communicate with colleagues in the other ``camp''. We scheduled the talks with sufficient buffer to have time left for interaction during the talks and for discussions in smaller groups between the talks. Details of the schedule kept changing during the seminar, reflecting the dynamic nature of this meeting. For Wednesday afternoon no talks were scheduled and some participants took advantage of this free afternoon for a hiking trip, some for an excursion to Trier, and others for more discussions.
As anticipated, one of the central topics of the seminar was the hardness of cryptographically relevant computational problems in the presence of quantum attacks: a number of talks addressed classical computational problems and the availability or non-availability of efficient quantum algorithms for these. Moreover, specific cryptographic proposals were discussed which were designed to offer resistance against adversaries with access to quantum computers. Security guarantees of such schemes may rely on some suitable computational hardness assumption, but also on other technological restrictions imposed on the attacker, or solely on the correctness of quantum mechanics. Talks on additional topics, specifically on efficient implementations, foundations of quantum computing and quantum information theory completed the program of the seminar. More details on the individual talks can be found in the abstracts following this introduction.
Looking at the extensive, fruitful, and passionate discussions in the seminar, it is fair to say that this meeting successfully fostered the exchange of two research communities. The presented talks and ensuing discussions added to our understanding of particular cryptographic constructions in the presence of quantum computers. Directions for future work on ``quantum-resistant'' cryptographic schemes have been indicated, and we hope that follow-up meetings will offer the opportunity to deepen the collaboration between quantum computing and cryptography and therewith help to advance the state-of-the-art in ``post quantum'' cryptography.
Dagstuhl Seminar Series
- Data Structures/Algorithms/Complexity
- Security / Cryptography
- Quantum Computing
- Post Quantum Cryptography
- Computational Algebra
- Cryptographic Protocol Design