Grant: Discovery Launch Supplement
University of Toronto
$12,500.00
Secure Computation with Minimal Communication
EF 2024-25
Résumé
The last decade has seen an explosion in the amount of digital data generated by individual users and organizations. Most of this data, including medical records, financial transactions, and cryptographic keys, must be kept confidential and stored securely. However, for many applications, it is necessary to process confidential data from multiple sources to achieve better results and more accurate predictions. Unfortunately, sharing sensitive data across entities might not be acceptable if they are in direct competition, or sharing such data might be explicitly prohibited by data protection laws like Canada's PIPEDA, the USA's HIPAA, and the EU's GDPR. Are there techniques to compute on confidential data held by different entities without compromising the data privacy?
Secure computation is a cryptographic primitive that enables computation on sensitive data while maintaining the confidentiality of the input data. At a high-level, secure computation is a distributed computation protocol that allows a set of parties to compute a function of their private inputs while revealing nothing beyond the output of the function.
The critical barrier that prevents the widespread adoption of secure computation is the communication overhead needed to implement these protocols. This communication overhead can be measured in the number of bits exchanged by the participants during the protocol execution (in other words, the communication complexity) and in the number of sequential messages exchanged before the output is computed (in other words, the round complexity). This overhead becomes especially significant when one aims to design protocols that retain their security properties even if some participants deviate arbitrarily from the protocol specification (denoted as malicious-secure protocols). These protocols are necessary in many real-world scenarios where we have no control over the behavior of the participants.
This proposal aims to develop new approaches for constructing malicious-secure protocols that require an optimal number of rounds and have low (and, in some cases, optimal) communication complexity. Toward this goal, we aim to pursue the following two broad research directions:
1. Construct malicious-secure protocols that have optimal round and communication costs for important cryptographic primitives that serve as building blocks in a variety of cryptographic constructions, including secure computation.
2. Design a modular approach to constructing round-optimal, malicious-secure protocols for computing general two-party and multiparty functions with low communication cost.
Programme
Discovery Launch Supplement
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
DGECR-2024-00516
Name nom
Srinivasan, Akshayaram
Department département
Department of Mathematical and Computational Sciences
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
12500
Program id
DGECR
Program name en
Discovery Launch Supplement
Program name fr
Supplément Tremplin vers la découverte
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
800
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
Information and communication services
Area of application fr
Services d'information et de télécommunications
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Secure Computation with Minimal Communication
Keywords
cryptography; secure computation; secure multiparty computation; malicious security; round optimality; communication optimality; semi-honest security
Application summary
The last decade has seen an explosion in the amount of digital data generated by individual users and organizations. Most of this data, including medical records, financial transactions, and cryptographic keys, must be kept confidential and stored securely. However, for many applications, it is necessary to process confidential data from multiple sources to achieve better results and more accurate predictions. Unfortunately, sharing sensitive data across entities might not be acceptable if they are in direct competition, or sharing such data might be explicitly prohibited by data protection laws like Canada's PIPEDA, the USA's HIPAA, and the EU's GDPR. Are there techniques to compute on confidential data held by different entities without compromising the data privacy?
Secure computation is a cryptographic primitive that enables computation on sensitive data while maintaining the confidentiality of the input data. At a high-level, secure computation is a distributed computation protocol that allows a set of parties to compute a function of their private inputs while revealing nothing beyond the output of the function.
The critical barrier that prevents the widespread adoption of secure computation is the communication overhead needed to implement these protocols. This communication overhead can be measured in the number of bits exchanged by the participants during the protocol execution (in other words, the communication complexity) and in the number of sequential messages exchanged before the output is computed (in other words, the round complexity). This overhead becomes especially significant when one aims to design protocols that retain their security properties even if some participants deviate arbitrarily from the protocol specification (denoted as malicious-secure protocols). These protocols are necessary in many real-world scenarios where we have no control over the behavior of the participants.
This proposal aims to develop new approaches for constructing malicious-secure protocols that require an optimal number of rounds and have low (and, in some cases, optimal) communication complexity. Toward this goal, we aim to pursue the following two broad research directions:
1. Construct malicious-secure protocols that have optimal round and communication costs for important cryptographic primitives that serve as building blocks in a variety of cryptographic constructions, including secure computation.
2. Design a modular approach to constructing round-optimal, malicious-secure protocols for computing general two-party and multiparty functions with low communication cost.