Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers

02/06/2021
by   Qifa Yan, et al.
0

This paper investigates the ultimate performance limits of Linear Function Retrieval (LFR) by cache-aided users from distributed coded servers. Each user aims to retrieve a linear function of the files of a library, which are Maximum Distance Separable (MDS) coded and stored at multiple servers.The system needs to guarantee robust decoding in the sense that each user must decode its demanded function with signals from any subset of servers whose cardinality exceeds a threshold. In addition, the following conditions must be met:(a) the content of the library must be kept secure from a wiretapper who obtains all the signals sent by the servers;(b) any subset of users together can not obtain any information about the demands of the remaining users;and (c) the users' demands must be kept private against all the servers even if they collude. A scheme that uses the superposition of security and privacy keys is proposed to meet all those conditions.The achieved load-memory tradeoff is the same as that achieved in single-server case scaled by the inverse of the MDS code rate used to encode the files, and the same optimality guarantees as in single-server setup are obtained.

READ FULL TEXT
research
01/20/2023

Robust, Private and Secure Cache-Aided Scalar Linear Function Retrieval from Blind Servers

This work investigates a system composed of multiple distributed servers...
research
09/13/2020

Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval

This work investigates the problem of cache-aided content Secure and dem...
research
01/27/2022

Multi-Access Cache-Aided Multi-User Private Information Retrieval

We consider the problem of multi-access cache-aided multi-user Private I...
research
12/26/2022

Cache-Aided Multi-User Private Information Retrieval using PDAs

We consider the problem of cache-aided multi-user private information re...
research
05/30/2018

Multi-Message Private Information Retrieval with Private Side Information

We consider the problem of private information retrieval (PIR) where a s...
research
05/11/2023

Demand Privacy in Hotplug Caching Systems

Coded caching, introduced by Maddah-Ali and Niesen (MAN), is a model whe...
research
02/01/2021

On Secure Distributed Linearly Separable Computation

Distributed linearly separable computation, where a user asks some distr...

Please sign up or login with your details

Forgot password? Click here to reset