Device-to-Device Secure Coded Caching

Abstract

This paper studies device to device (D2D) codedcaching with information theoretic security guarantees. A broadcast network consisting of a server, which has a library of files, and end users equipped with cache memories, is considered. Information theoretic security guarantees for confidentiality are imposed upon the files. The server populates the end user caches, after which D2D communications enable the delivery of the requested files. Accordingly, we require that a user must not have access to files it did not request, i.e., secure caching. First, a centralized coded caching scheme is provided by jointly optimizing the cache placement and delivery policies. Next, a decentralized coded caching scheme is developed that does not require the knowledge of the number of active users during the caching phase. Both schemes utilize non-perfect secret sharing and onetime pad keying, to guarantee secure caching. Furthermore, the proposed schemes provide secure delivery as a side benefit, i.e., any external entity which overhears the transmitted signals during the delivery phase cannot obtain any information about the database files. The proposed schemes provide the achievable upper bound on the minimum delivery sum rate. Lower bounds on the required transmission sum rate are also derived using cut-set arguments indicating the multiplicative gap between the lower and upper bounds. Numerical results indicate that the gap vanishes with increasing memory size. Overall, the work demonstrates the effectiveness of D2D communications in cacheaided systems even when confidentiality constraints are imposed at the participating nodes and against external eavesdroppers.

Device-to-Device Communications in Cloud, MANET and Internet of Things Integrated Architecture

“…The light weighted cryptographic system could be a proper solution for covering resource-constrained devices in D2D communication [26]. The efficiency of D2D communications in cacheaided structures, even though privacy restrictions are enforced on the engaging endpoints and on extrinsic snoopers [27]. The efficiency of D2D communications in cache-aided structures, even though privacy restrictions are enforced on the engaging endpoints and on extrinsic snoopers [28].…”

A Secretive Coded Caching for Shared Cache Systems using PDAs

“…The secure delivery condition was addressed separately in [9]. The secretive coded caching problem was then extended to other settings that include shared cache networks [10] device-to-device networks [11], combination networks [12] and considering collusion among users in dedicated cache network [13]. We consider the problem of secretive coded caching with shared caches introduced in [10].…”

Device-to-Device Coded-Caching With Distinct Cache Sizes

“…Coded caching in device-to-device networks has been investigated in [6], [17]- [23]. In particular, D2D coded caching was first considered in [6], where centralized and decentralized caching schemes have been proposed for when the users have equal cache sizes.…”

“…Reference [22] has proposed a secure D2D delivery scheme that protects the D2D transmissions in the presence of an eavesdropper. Reference [23] has considered secure D2D coded caching when each user can recover its requested file and is simultaneously prevented from accessing any other file.…”