
NSF Org: |
CCF Division of Computing and Communication Foundations |
Recipient: |
|
Initial Amendment Date: | June 22, 2020 |
Latest Amendment Date: | June 22, 2020 |
Award Number: | 2007067 |
Award Instrument: | Standard Grant |
Program Manager: |
Phillip Regalia
pregalia@nsf.gov (703)292-2981 CCF Division of Computing and Communication Foundations CSE Directorate for Computer and Information Science and Engineering |
Start Date: | October 1, 2020 |
End Date: | September 30, 2024 (Estimated) |
Total Intended Award Amount: | $281,704.00 |
Total Awarded Amount to Date: | $281,704.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
3124 TAMU COLLEGE STATION TX US 77843-3124 (979)862-6777 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
WEB 301R, Dept of Electrical and College Station TX US 77843-3123 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | Comm & Information Foundations |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
Powerful and ubiquitous sensors and devices nowadays can collect data on all types of human activities and natural phenomena. These data sets are usually aggregated and stored in a distributed storage system, from which information can then be retrieved as needed for processing and computation. Making such systems private and secure is of paramount importance, which has motivated the study of private information retrieval (PIR) systems, which can provide strong privacy guarantees on the access to information in these databases. Characterizing the level of guarantees will help assess the usefulness of a PIR system. This project aims to develop a holistic information theoretic view of PIR systems, which can provide important theoretical guidance on the design of private, secure, and efficient information retrieval systems.
In the framework of this holistic view, this project seeks to identify the information theoretic limits and develop efficient code constructions for the optimal tradeoffs between important system constraints, including communication, storage, complexity, and security. This holistic view goes beyond many information theoretic studies that focus on a single aspect of the system constraints, namely the communication cost. The project is expected to significantly advance the state-of-the-art: it seeks to provide a better balanced and comprehensive understanding on the tradeoffs between different constraints in general information retrieval systems.
This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
Note:
When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external
site maintained by the publisher. Some full text articles may not yet be available without a
charge during the embargo (administrative interval).
Some links on this page may take you to non-federal websites. Their policies may differ from
this site.
PROJECT OUTCOMES REPORT
Disclaimer
This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.
The team explored and carefully studied various aspects of private information retrieval primitive, and push forward significantly on the fundamental theory of this security primitive via the proposed holistic view. New information-theoretic limits have been identified, and novel code designs have been proposed. The team obtained significant results on the following three specific areas. Firstly, on the study of the tradeoff between the storage and download cost, the team developed a Shannon-theoretic approach and provided new coding techniques based on this approach. This approach provides a unified view on the classical information-theoretic coding schemes and more modern code designs in the context of private information retrieval, and it is a significant theoretic achievement. The team further utilized the computer-based information-theoretic approach to study this problem, and obtained novel representation of the fundamental limit, as well as new improved bounds on the tradeoff. Secondly, on the tradeoff between privacy leakage and the download cost, sometimes referred to as weakly private information retrieval or leaky private information retrieval, the team quantitatively studied the leakage under different measures, such as the maximal leakage, mutual information, and differential privacy, and obtained efficient optimized code designs under these settings. The settings were further generalized to allow the servers to be heterogeneously trusted, where novel codes were proposed that can utilize such heterogeneity with significant gain. Thirdly, the team studied private information retrieval with multiple level of privacy requirements. The problem formulation by itself is non-trivial, where the levels were carefully quantified by different numbers of colluding servers in such systems. Novel code designs were proposed for this setting, which shows significant improvement over the baseline approach of ignoring these different levels of privacy requirements. The project led to 4 published journal papers and 1 journal submission, and 4 published conference paper and 1 conference paper submission.
Multiple graduate students have been trained in the context of this project. In particularly, two female M.S. students were involved and trained, and one of them is continuing her Ph.D. study in PI's group. These students gained significant experience in rigorous reasoning, optimization, and information theory by participating in this project.
Last Modified: 01/07/2025
Modified by: Chao Tian
Please report errors in award information by writing to: awardsearch@nsf.gov.