Grant: Discovery Grants Program - Individual
University of Calgary
$30,000.00
Practical secure computation
EF 2014-15
Résumé
There are many important algorithms (applications) with privacy-sensitive inputs that come from different sources. A number of examples can be found in applications such as health care, genomic computation, data mining, web services, digital libraries, and e-commerce. These algorithms are often run on large sets of data that come from different sources. For instance, a data mining application might need to run a clustering algorithm on input data from rival businesses, or from government agencies with conflicting privacy mandates. An application in health care might need to run statistical analysis on several health records without violating the privacy of individual patients. In several countries there are now legislations in place that regulate the use and disclosure of private information by companies and government agencies. The sensitivity of such data limits these organizations' ability to share, or engage in collaborative studies on them. These problems can be formulated as instances of a fundamental problem in the realm of cryptography and distributed computing, namely ""secure multiparty computation"". The research on this problem has led to important and classic results. However, despite the impressive theoretical achievements of the last two decades, the majority of existing constructions are too complex and inefficient to be adopted in practice.The long term goal of this research is to identify the underlying reasons behind this discrepancy between theory and practice and to design efficient protocols that bridge this gap. Towards this goal we mainly focus on three research directions: (i) Designing efficient mechanisms to protect against strong but realistic adversaries such as malicious faults, side-channel attacks, and realistically weakened variants (ii) Developing customized protocols for important problems: We plan to design secure computation protocols for problems in data mining, genomic computation, network algorithms, key distribution, electronic voting and more. (iii) Implementing the protocols we design is an important measure of their practicality and helps us study important properties such as their scalability and the tradeoffs between the communication and computation costs.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
386170-2010
Name nom
Mohassel, Payman
Department département
Computer Science
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2010
Award amount
30000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
5
Nb partie
5
Application title
Practical secure computation
Keyword
NSERC
Application summary
There are many important algorithms (applications) with privacy-sensitive inputs that come from different sources. A number of examples can be found in applications such as health care, genomic computation, data mining, web services, digital libraries, and e-commerce. These algorithms are often run on large sets of data that come from different sources. For instance, a data mining application might need to run a clustering algorithm on input data from rival businesses, or from government agencies with conflicting privacy mandates. An application in health care might need to run statistical analysis on several health records without violating the privacy of individual patients. In several countries there are now legislations in place that regulate the use and disclosure of private information by companies and government agencies. The sensitivity of such data limits these organizations' ability to share, or engage in collaborative studies on them. These problems can be formulated as instances of a fundamental problem in the realm of cryptography and distributed computing, namely ""secure multiparty computation"". The research on this problem has led to important and classic results. However, despite the impressive theoretical achievements of the last two decades, the majority of existing constructions are too complex and inefficient to be adopted in practice.The long term goal of this research is to identify the underlying reasons behind this discrepancy between theory and practice and to design efficient protocols that bridge this gap. Towards this goal we mainly focus on three research directions: (i) Designing efficient mechanisms to protect against strong but realistic adversaries such as malicious faults, side-channel attacks, and realistically weakened variants (ii) Developing customized protocols for important problems: We plan to design secure computation protocols for problems in data mining, genomic computation, network algorithms, key distribution, electronic voting and more. (iii) Implementing the protocols we design is an important measure of their practicality and helps us study important properties such as their scalability and the tradeoffs between the communication and computation costs.