CLOUD SECURITY BASED CODED CACHING WITH LARGE NUMBER OF DISTRIBUTED NETWORK

International Journal of Computer Science (IJCS) Published by SK Research Group of Companies (SKRGC)

Abstract

The information theoretic models of coded caching in this paper incorporate the notion of cache-tapping. In the presence of several receivers with fixed-size cache memories and an opponent who selects symbols to tap into from cache placement and/or delivery, the wire-tap channel II is presented. The actual terminals are unaware of their locations or whether they are being tapped for placement, distribution, or both. Only the tapped set's overall size is known. For two receivers and two files, the strong secrecy capacity—the highest practicable file rate while maintaining the strong security of the whole library—is determined. Lower and higher limits on the strong secrecy file rate are determined when the library has more than two files. A code design that includes wiretap coding, security embedding codes, one-time pad keys, and coded caching is necessary for attainability. By using a genie-assisted upper bound, in which the transmitter is provided with user demands before to placement, the opposite for the two-files case is created. The upper bound is constructed using three sequential channel modifications when there are more than two files. In a cache-aided system, our findings offer verifiable security assurances against a powerful attacker that maximises its tapping during both communication stages.

References

1. Beamforming Design for Wireless Coded Caching with Different Cache Sizes: Antti Tölli_2022
2. Rajkumar, V., and V. Maniraj. "Hybrid Traffic Allocation Using Application-Aware Allocation Of Resources In Cellular Networks." Shodhsamhita (ISSN: 2277-7067) 12.8 (2021).
3. Linear Network Coded Wireless Caching in Cloud Radio Access Network: Long Shi _2021
4. Secretive Coded Caching With Shared Caches: Shreya Shrestha Meel_2021
5. Coded Caching Does Not Generally Benefit From Selfish Caching: Federico _2022
6. On the Fundamental Limits of Fog-RAN Cache-Aided Networks With Downlink and Sidelink Communications: Kai Wan_2021
7. Exploiting Joint-Cache-Channel Coding for Decentralized Coded Caching With Heterogeneous Link Rates and Cache Sizes: Aimin Tang, Yao Liu, Xudong Wang_2021
8. Rajkumar, V., and V. Maniraj. "RL-ROUTING: a deep reinforcement learning sdn routing algorithm." journal of education: rabindrabharati university (ISSN: 0972-7175) 24.12 (2021).
9. A Novel Transformation Approach of Shared-link Coded Caching Schemes for Multiaccess Networks: Giuseppe Caire_2021
10. "Dependency Aware Caching (Dac) For Software Defined Networks.", Rajkumar, V., and V. Maniraj.Webology (ISSN: 1735-188X) 18.5 (2021).
11. Benefits of Edge Caching With Coded Placement for Asymmetric Networks and Shared Caches: Aylin Yener_2021
12. Rajkumar, V., and V. Maniraj. "Privacy-Preserving Computation With An Extended Framework And Flexible Access Control." 48.10 (2021).
13. Decentralized Coded Caching for Shared Caches: Anoop Thomas_2021
14. Coded Caching with Shared Caches from Generalized Placement Delivery Arrays: Elizabath Peter, B. Sundar Rajan_2021
15. Multi-source spinal coding for coded caching multicast transmissions in wireless networks: Aimin Tang, Xudong Wang_2021
16. "Software-Defined Networking's Study with Impact on Network Security." Design Engineering (ISSN: 0011-9342) 8 (2021), Rajkumar, V., and V. Maniraj.
17. Cache-Aided Polar Coding: From Theory to Implementation: Sarah Kamel_2021
18. ECC-United Cache: Maximizing Efficiency of Error Detection/Correction Codes in Associative Cache Memories: Soontae Kim_2021

19. Rajkumar, V., and V. Maniraj. "HCCLBA: Hop-By-Hop Consumption Conscious Load Balancing Architecture Using Programmable Data Planes." Webology (ISSN: 1735-188X) 18.2 (2021).
20. A Coded Caching Scheme with Linear Sub-packetization and its Application to Multi-Access Coded Caching:B. Sundar Rajan_2021

Keywords

Cloud Computing, Caching, Distributed Network.