Skip to feedback

Award Abstract # 2144798
CAREER: Sketching for Secure Computation on Large Inputs

NSF Org: CNS
Division Of Computer and Network Systems
Recipient: GEORGE WASHINGTON UNIVERSITY (THE)
Initial Amendment Date: June 30, 2022
Latest Amendment Date: July 16, 2024
Award Number: 2144798
Award Instrument: Continuing Grant
Program Manager: Anna Squicciarini
asquicci@nsf.gov
 (703)292-5177
CNS
 Division Of Computer and Network Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: July 1, 2022
End Date: June 30, 2027 (Estimated)
Total Intended Award Amount: $597,620.00
Total Awarded Amount to Date: $364,745.00
Funds Obligated to Date: FY 2022 = $119,980.00
FY 2023 = $119,726.00

FY 2024 = $125,039.00
History of Investigator:
  • Arkady Yerukhimovich (Principal Investigator)
    arkady@gwu.edu
Recipient Sponsored Research Office: George Washington University
1918 F ST NW
WASHINGTON
DC  US  20052-0042
(202)994-0728
Sponsor Congressional District: 00
Primary Place of Performance: George Washington University
800 22nd St NW Rm 4570
Washington DC
DC  US  20052-0066
Primary Place of Performance
Congressional District:
00
Unique Entity Identifier (UEI): ECR5E2LU5BL6
Parent UEI:
NSF Program(s): Secure &Trustworthy Cyberspace
Primary Program Source: 01002223DB NSF RESEARCH & RELATED ACTIVIT
01002324DB NSF RESEARCH & RELATED ACTIVIT

01002425DB NSF RESEARCH & RELATED ACTIVIT

01002526DB NSF RESEARCH & RELATED ACTIVIT

01002627DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 025Z, 1045
Program Element Code(s): 806000
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Today, privacy sensitive personal data is everywhere. Collecting and performing analytics on large amounts of personal data has become widespread and is intrinsic to the functionality of a rapidly growing number of apps and services. While desirable from a functionality perspective, this now popular computing paradigm raises unprecedented security and privacy concerns. A key research challenge is to design protocols for secure and private computation that can scale to these massive volumes of data. The focus of this project is to develop such protocols by combining techniques from secure multi-party computation, sketching algorithms, and differential privacy.

To make secure computation scale to massive inputs, it is necessary to develop protocols with costs (i.e., computation and communication) sublinear in the input size. This project combines advances in all three of the areas mentioned above to achieve this goal. First, the project studies the privacy properties of sketching algorithms and develops algorithms well suited to secure multi-party computation. Next, the project will study the necessary modification to make the resulting protocols robust to malicious users and inputs. Then, it will consider how the approximate nature of sketching algorithms impacts the privacy of the resulting computations and leverage differential privacy to ensure that individual privacy is maintained. Finally, the project combines these approaches to instantiate protocols for real-world applications. The results of this project will enable new secure and privacy-preserving computations for large-data applications such as machine learning and network measurement. Additionally, the project will result in research opportunities and new course materials for graduate and undergraduate students.

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.

Choi, Seung Geol and Dachman-Soled, Dana and Gordon, S. Dov and Liu, Linsheng and Yerukhimovich, Arkady "Secure Sampling with Sublinear Communication" Theory of Cryptography Conference , 2022 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page