Project Grant 2516634

COLLABORATIVE RESEARCH: CIF: MEDIUM: FUNDAMENTAL LIMITS OF CACHE-AIDED MULTI-USER PRIVATE FUNCTION RETRIEVAL -THIS PROJECT IS MOTIVATED BY THE NEED TO EFFICIENTLY EXECUTE COMPLEX QUERIES ON MASSIVE DATABASES IN A WAY THAT MINIMIZES THE USE OF COMMUNICATION RESOURCES WHILE PRESERVING THE PRIVACY OF THE ENTITY THAT INITIATED THE QUERY. SUCH QUERIES ARE FUNCTIONS OF THE DATA POINTS THAT ARE STORED AT REMOTE SERVERS; FOR EXAMPLE, BI-LINEAR OPERATIONS ARE WIDELY USED FUNDAMENTAL PRIMITIVES FOR BUILDING THE COMPLEX QUERIES THAT SUPPORT ON-LINE BIG-DATA ANALYTICS AND DATA MINING PROCEDURES. IN SCENARIOS SUCH AS MOBILE-EDGE COMPUTING, IT IS TOO RESOURCE-CONSUMING TO DOWNLOAD LOCALLY ALL THE INPUT VARIABLES IN ORDER TO COMPUTE THE DESIRED OUTPUT VALUE. INSTEAD, IT IS DESIRABLE TO DIRECTLY DOWNLOAD THE RESULT OF THE DESIRED OUTPUT FUNCTION, WHICH SHOULD ALSO BE KEPT PRIVATE. THIS PROJECT DEVELOPS A PRINCIPLED AND HOLISTIC FRAMEWORK FOR THE PROBLEM OF PRIVATELY RETRIEVING, AT DISTRIBUTED CACHE-AIDED NODES, THE OUTPUT OF FUNCTIONS BASED ON BOTH DATA THAT IS LOCALLY COMPUTED AND DATA THAT IS RECEIVED FROM MULTIPLE SERVERS. THIS PROBLEM IS AT THE INTERSECTION OF AREAS THAT INDIVIDUALLY HAVE RECEIVED SIGNIFICANT ATTENTION LATELY, NAMELY, DISTRIBUTED CODED CACHING AND PRIVATE INFORMATION RETRIEVAL. THIS PROJECT AIMS TO SIGNIFICANTLY ADVANCE THE STATE-OF-THE-ART OF PRIVATE FUNCTION RETRIEVAL IN DISTRIBUTED SETTINGS FROM BOTH AN INFORMATION THEORY AND AN ALGORITHM DESIGN PERSPECTIVE, THUS ESTABLISHING A FOUNDATION OF PRIVATE CACHING, COMPUTING AND COMMUNICATION. THE PROJECT ALSO FEATURES A RICH EDUCATIONAL COMPONENT. THE NOVEL FINDINGS FROM THIS PROJECT WILL BE INCORPORATED INTO THE EDUCATION OFFERINGS, IN BOTH UNDERGRADUATE AND GRADUATE LEVELS, AT THE THREE COLLABORATING INSTITUTIONS. THE PROJECT OBJECTIVES ARE ORGANIZED IN THREE MAIN RESEARCH THRUSTS: (1) DESIGN OPTIMAL CODED CACHING SCHEMES FOR USER-PRIVATE FUNCTION RETRIEVAL; (2) MOTIVATED BY DISTRIBUTED SETTINGS IN WHICH A USER MAY ALSO BE A SENDER, DEVISE OPTIMAL SERVER-PRIVATE FUNCTION RETRIEVAL STRATEGIES; AND (3) OVERCOME COMPLEXITY BOTTLENECKS IN PRACTICAL DISTRIBUTED COMPUTING SYSTEMS WITH SERVER- AND/OR USER-PRIVACY. THE DESIGNED CODES AND ALGORITHMS WILL BE IMPLEMENTED ON AMAZON EC2 AND POWDER (5G PLATFORM) TO PROVIDE A PROOF-OF-CONCEPT THAT THE PROPOSED SOLUTIONS HAVE A PRACTICAL IMPACT AT SCALE. 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.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.