Coding caching method for user privacy protection based on decentralization

Abstract Coded caching reduces the communication load substantially, exploiting the caches of end devices to generate multicast opportunities during the transmission phase. To address user‐request privacy, we propose a decentralized coding caching method that focuses on protecting user privacy. This method involves creating file subpackages for users to cache linear combinations of files. We also expand the key scheme for decentralized situations, ensuring that files shared among users do not exceed each user's cache size. We make sure that the unencoded part of each packet in the user cache is larger than the size of the cached file after being cut, determining the range of values for the file allocation coefficient, θ . With fixed N and M , we can calculate that the load is a convex function of θ . Through mathematical analysis, we can determine the worst case load scenario. Subsequent simulation results unequivocally demonstrate the capability of the proposed scheme to fulfill any file request from users, all while achieving a communication load comparable to that of an enhanced distributed nonprivate cache scheme.