Your browser is unsupported

We recommend using the latest version of IE11, Edge, Chrome, Firefox or Safari.

Cache-aided Function Retrieval with Security and Privacy Constraints


  1. NSF(Award Number:1910309) CIF: Small: Fundamental Tradeoffs Between Communication Load and Storage Resources in Distributed systems

Problem Statement and Motivation 

  • Caching is an effective way to smooth out network traffic in peak times by storing locally content during peak-off times.
  • Caching has two phases: placement (limited only by the size of the local cache and designed without knowledge of future demands) and delivery (where the goal is to minimize the number of broadcast transmissions so that every receiver can decode the desired message)
  • In this work we study how users can retrieve functions from possibly distributed servers while maintaining user- and server-privacy as well as security from eavesdroppers.

Technical Approach

  • We extend tools for the classical shared single bottleneck-link caching problem to networks with legitimate users (interested in retrieving a function of the files at the servers) and eavesdroppers.
  • We derive achievable and converse bounds that are to within a constant gap of one another.

Key Achievements and Future Goals

  • We derived state-of-the-art achievable and converse bounds, which meet for some network parameters.
  • Results presented at:

See Full PDF