Grant: Discovery Grants Program - Individual
University of British Columbia
$34,000.00
Cryptographic primitives and error control coding
EF 2012-13
Résumé
The first part of the proposal is concerned with the investigation of the fundamental primitives of cryptography of homomorphic encryption and hash functions. Homomorphic encryption systems find wide application in numerous important cryptographic protocols. New homomorphic encryption systems will be developed with a view to making their application to certain secure multiparty computation protocols more efficient. Hash functions are an essential part of many commonly used cryptographic protocols such as digital signatures. Most currently used such functions are fast but lack a security proof. The few currently known hash functions that have some form of security proof tend to rely on sophisticated mathematics and are very slow. The proposed research will investigate possible techniques to formulate a new function that has some form of security proof and improves on the speed.
For the second part of the proposal, further properties of random coding techniques for the erasure channel will be considered. Such systems have proved very useful for multicast internet downloads where a symbol erasure corresponds to a packet loss. Systems that have linear complexity (in the number of information symbols) encoding and decoding techniques, for the binary case, are available although have limitations in terms of implementation. Nonbinary systems will be investigated that have the potential to improve performance and efficiency in terms of speeds of convergence and simplicity of implementation.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
7382-2010
Name nom
Blake, Ian
Department département
Electrical and Computer Engineering
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
34000
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
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
2507
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications systems
Research subject fr
Systèmes de télécommunications
Partie
3
Nb partie
5
Application title
Cryptographic primitives and error control coding
Keyword
NSERC
Application summary
The first part of the proposal is concerned with the investigation of the fundamental primitives of cryptography of homomorphic encryption and hash functions. Homomorphic encryption systems find wide application in numerous important cryptographic protocols. New homomorphic encryption systems will be developed with a view to making their application to certain secure multiparty computation protocols more efficient. Hash functions are an essential part of many commonly used cryptographic protocols such as digital signatures. Most currently used such functions are fast but lack a security proof. The few currently known hash functions that have some form of security proof tend to rely on sophisticated mathematics and are very slow. The proposed research will investigate possible techniques to formulate a new function that has some form of security proof and improves on the speed.
For the second part of the proposal, further properties of random coding techniques for the erasure channel will be considered. Such systems have proved very useful for multicast internet downloads where a symbol erasure corresponds to a packet loss. Systems that have linear complexity (in the number of information symbols) encoding and decoding techniques, for the binary case, are available although have limitations in terms of implementation. Nonbinary systems will be investigated that have the potential to improve performance and efficiency in terms of speeds of convergence and simplicity of implementation.