Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université de Montréal

$24,000.00

Two-party quantum cryptography

FY 2009-10

Summary
In 1984, Bennett and Brassard proposed a scheme allowing two parties to agree on a secret key provided they have access to a channel capable of transmitting quantum bits. This scheme, called quantum key distribution, is remarkable since it achieves something impossible through classical means alone. Until the mid 90's quantum information appeared to be cryptographers' best friend. Expectations were that all modern cryptographic applications could be resolved unconditionally using quantum communication whereas classical cryptography could only hope for security relying upon unproven computational assumptions out of which the majority do not hold against quantum adversaries. One essential class of cryptographic applications are the ones involving two parties willing to collaborate but otherwise not trusting each other. Many daily electronic transactions are of that kind, making two-party cryptography a critical tool for the information age. An example is our frequent interactions with ATMs asking us to identify ourselves before being granted access to our bank account. In 1995, Mayers and Lo & Chau shattered this dream when they prove that the most important cryptographic primitives for two-party cryptography cannot be implemented securely using quantum communication. On the other hand, quantum protocols have been found for weak two-party primitives otherwise impossible using classical communication alone. Unlike for key distribution, the capabilities of quantum cryptography in the two-party setting are not well understood. The project's main goal is to provide a deeper understanding for the true power of quantum cryptography in two-party applications. Improving our insight on what it can achieve in this setting could have important consequences for the design of systems providing security in electronic transactions. New systems inspired by this research could offer privacy more efficiently and under weaker assumptions. Even entirely classical protocols could benefit from this work by extending the realm of their security to adversaries in possession of quantum computers. Any satisfactory advance toward our main objective would improve our comprehension of the differences between classical and quantum information.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
356101-2009
Name nom
Salvail, Louis
Department département
Informatique et recherche opérationnelle
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2009
Award amount
24000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2718
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Communication and information theory
Research subject fr
Théorie des télécommunications et de l'information
Partie
1
Nb partie
5
Application title
Two-party quantum cryptography
Keyword
NA
Application summary
In 1984, Bennett and Brassard proposed a scheme allowing two parties to agree on a secret key provided they have access to a channel capable of transmitting quantum bits. This scheme, called quantum key distribution, is remarkable since it achieves something impossible through classical means alone. Until the mid 90's quantum information appeared to be cryptographers' best friend. Expectations were that all modern cryptographic applications could be resolved unconditionally using quantum communication whereas classical cryptography could only hope for security relying upon unproven computational assumptions out of which the majority do not hold against quantum adversaries. One essential class of cryptographic applications are the ones involving two parties willing to collaborate but otherwise not trusting each other. Many daily electronic transactions are of that kind, making two-party cryptography a critical tool for the information age. An example is our frequent interactions with ATMs asking us to identify ourselves before being granted access to our bank account. In 1995, Mayers and Lo & Chau shattered this dream when they prove that the most important cryptographic primitives for two-party cryptography cannot be implemented securely using quantum communication. On the other hand, quantum protocols have been found for weak two-party primitives otherwise impossible using classical communication alone. Unlike for key distribution, the capabilities of quantum cryptography in the two-party setting are not well understood. The project's main goal is to provide a deeper understanding for the true power of quantum cryptography in two-party applications. Improving our insight on what it can achieve in this setting could have important consequences for the design of systems providing security in electronic transactions. New systems inspired by this research could offer privacy more efficiently and under weaker assumptions. Even entirely classical protocols could benefit from this work by extending the realm of their security to adversaries in possession of quantum computers. Any satisfactory advance toward our main objective would improve our comprehension of the differences between classical and quantum information.