Abstract

Coded caching is beneficial due to its ability to leverage the multicast property of a wireless channel. Under specific network settings, the coded caching scheme has been shown to reveal the user file requests. In prior work, a privacy attack by a single attacker on coded caching was presented. In this letter, we focus on a relatively secure setting whereby only the intended users access the files. Nevertheless, we show that, even in this setting, privacy is compromised if the users are colluding. The time complexity of the attack on a network with $N$ files, $K$ users, and $l \leq K$ colluding users is shown to be in the order of $\sqrt {\ln (N(K-l))}N^{(K-l)/2}$ steps.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.