Computer Sciences and Information Technology
Title : | Efficient Multiparty computation and applications |
Area of research : | Computer Sciences and Information Technology |
Focus area : | Cryptography, Secure Computation |
Principal Investigator : | Dr. SaiLakshmiBhavana Obbattu , Indian Institute Of Technology (BHU), Uttar Pradesh |
Timeline Start Year : | 2024 |
Timeline End Year : | 2026 |
Contact info : | oslbhavana2@gmail.com |
Equipments : | Cloud Compute
Desktop
Printer cum scanner
Server Grade Machine |
Details
Executive Summary : | Multiparty computation is about multiple parties each individually holding private inputs aim to compute a function on their inputs. Here the key requirement is that while computing the function output none of the parties should learn anything additional about each other's private input. Though theoretically computing any function while guaranteeing privacy is possible, the solutions are generic and may not always be efficient. For example consider the problem of private set intersection where parties want to compute intersection of their private sets following a generic solution would not be efficient. In this proposal the aim is to build efficient solutions for specific problem instances of multiparty computation |
Total Budget (INR): | 20,43,840 |
Organizations involved