Grant: Discovery Grants Program - Individual
University of Waterloo
$33,280.00
Pairing-based cryptography
FY 2015-16
Summary
Since 2000, bilinear pairings have become an extremely useful instrument in the cryptographer's toolbox. Initial breakthroughs such as a one-round tripartite key agreement protocol and a practical solution to the problem of identity-based encryption have led to an extensive body of research on cryptographic applications of bilinear pairings. Pairing-based cryptographic protocols are expected to see widespread deployment in the coming years as the demand for security and privacy-preserving technologies increases. The proposed research program is a comprehensive study of the efficiency, security, and functionality of these protocols.
I will investigate the feasibility of implementing pairing-based protocols on workstation-class processors. All pairing types will be considered, including those derived from elliptic curves and genus-2 hyperelliptic curves defined over finite fields. The properties of the underlying hardware will be exploited to improve performance. For example, I will explore the effectiveness of the recently-introduced carryless multiplication instruction on Intel chips for accelerating pairing arithmetic over characteristic-two finite fields.
I will continue an ongoing project whose aim is to better understand the concrete security guarantees actually provided by reductionist security proofs for pairing-based protocols. This work will include a detailed study and comparison of the numerous cryptographic assumptions that underly the security of the protocols, and an in-depth study of the pairing inversion problem.
Lastly, I will critically analyze some practical scenarios in which pairing-based protocols such as identity-based encryption, aggregate signatures, and group signatures, can potentially offer significant benefits over their non-pairing counterparts and can be efficiently and securely deployed.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
203813-2011
Name nom
Menezes, Alfred
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2011
Award amount
33280
Program id
RGPIN
Program name 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
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2508
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications networks
Research subject fr
Réseaux de télécommunications
Partie
4
Nb partie
5
Application title
Pairing-based cryptography
Keyword
NSERC
Application summary
Since 2000, bilinear pairings have become an extremely useful instrument in the cryptographer's toolbox. Initial breakthroughs such as a one-round tripartite key agreement protocol and a practical solution to the problem of identity-based encryption have led to an extensive body of research on cryptographic applications of bilinear pairings. Pairing-based cryptographic protocols are expected to see widespread deployment in the coming years as the demand for security and privacy-preserving technologies increases. The proposed research program is a comprehensive study of the efficiency, security, and functionality of these protocols.
I will investigate the feasibility of implementing pairing-based protocols on workstation-class processors. All pairing types will be considered, including those derived from elliptic curves and genus-2 hyperelliptic curves defined over finite fields. The properties of the underlying hardware will be exploited to improve performance. For example, I will explore the effectiveness of the recently-introduced carryless multiplication instruction on Intel chips for accelerating pairing arithmetic over characteristic-two finite fields.
I will continue an ongoing project whose aim is to better understand the concrete security guarantees actually provided by reductionist security proofs for pairing-based protocols. This work will include a detailed study and comparison of the numerous cryptographic assumptions that underly the security of the protocols, and an in-depth study of the pairing inversion problem.
Lastly, I will critically analyze some practical scenarios in which pairing-based protocols such as identity-based encryption, aggregate signatures, and group signatures, can potentially offer significant benefits over their non-pairing counterparts and can be efficiently and securely deployed.