The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files

Mohamed Nafea, Aylin Yener

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A wiretap model with two receivers equipped with fixed-size cache memories, and a type II adversary is considered. The adversary in this model chooses a subset of symbols to tap into either from cache placement, delivery transmission, or both phases. The legitimate parties do not know the fractions or the positions of the tapped symbols in either phase. For a library of size three files or more, lower and upper bounds on the strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, are derived. The strong secrecy capacity is identified for the instance of large tapped subsets. Achievability is established by wiretap coding, security embedding codes, one-time pad keys, and coded caching techniques. The upper bound is constructed by three successive channel transformations.

Original languageEnglish (US)
Title of host publication2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages989-996
Number of pages8
ISBN (Electronic)9781538665961
DOIs
StatePublished - Feb 5 2019
Event56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018 - Monticello, United States
Duration: Oct 2 2018Oct 5 2018

Publication series

Name2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018

Conference

Conference56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018
CountryUnited States
CityMonticello
Period10/2/1810/5/18

Fingerprint

Broadcast Channel
Caching
Cache
Wire
Cache memory
Subset
Placement
Upper and Lower Bounds
Receiver
Coding
Choose
Upper bound
Model
Libraries

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing
  • Energy Engineering and Power Technology
  • Control and Optimization

Cite this

Nafea, M., & Yener, A. (2019). The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files. In 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018 (pp. 989-996). [8635931] (2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2018.8635931
Nafea, Mohamed ; Yener, Aylin. / The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II : Multiple Library Files. 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 989-996 (2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018).
@inproceedings{011f0a011c7342349b8bbdb3ec6efc9e,
title = "The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files",
abstract = "A wiretap model with two receivers equipped with fixed-size cache memories, and a type II adversary is considered. The adversary in this model chooses a subset of symbols to tap into either from cache placement, delivery transmission, or both phases. The legitimate parties do not know the fractions or the positions of the tapped symbols in either phase. For a library of size three files or more, lower and upper bounds on the strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, are derived. The strong secrecy capacity is identified for the instance of large tapped subsets. Achievability is established by wiretap coding, security embedding codes, one-time pad keys, and coded caching techniques. The upper bound is constructed by three successive channel transformations.",
author = "Mohamed Nafea and Aylin Yener",
year = "2019",
month = "2",
day = "5",
doi = "10.1109/ALLERTON.2018.8635931",
language = "English (US)",
series = "2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "989--996",
booktitle = "2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018",
address = "United States",

}

Nafea, M & Yener, A 2019, The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files. in 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018., 8635931, 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, Institute of Electrical and Electronics Engineers Inc., pp. 989-996, 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, Monticello, United States, 10/2/18. https://doi.org/10.1109/ALLERTON.2018.8635931

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II : Multiple Library Files. / Nafea, Mohamed; Yener, Aylin.

2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018. Institute of Electrical and Electronics Engineers Inc., 2019. p. 989-996 8635931 (2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II

T2 - Multiple Library Files

AU - Nafea, Mohamed

AU - Yener, Aylin

PY - 2019/2/5

Y1 - 2019/2/5

N2 - A wiretap model with two receivers equipped with fixed-size cache memories, and a type II adversary is considered. The adversary in this model chooses a subset of symbols to tap into either from cache placement, delivery transmission, or both phases. The legitimate parties do not know the fractions or the positions of the tapped symbols in either phase. For a library of size three files or more, lower and upper bounds on the strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, are derived. The strong secrecy capacity is identified for the instance of large tapped subsets. Achievability is established by wiretap coding, security embedding codes, one-time pad keys, and coded caching techniques. The upper bound is constructed by three successive channel transformations.

AB - A wiretap model with two receivers equipped with fixed-size cache memories, and a type II adversary is considered. The adversary in this model chooses a subset of symbols to tap into either from cache placement, delivery transmission, or both phases. The legitimate parties do not know the fractions or the positions of the tapped symbols in either phase. For a library of size three files or more, lower and upper bounds on the strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, are derived. The strong secrecy capacity is identified for the instance of large tapped subsets. Achievability is established by wiretap coding, security embedding codes, one-time pad keys, and coded caching techniques. The upper bound is constructed by three successive channel transformations.

UR - http://www.scopus.com/inward/record.url?scp=85062852686&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062852686&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2018.8635931

DO - 10.1109/ALLERTON.2018.8635931

M3 - Conference contribution

AN - SCOPUS:85062852686

T3 - 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018

SP - 989

EP - 996

BT - 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Nafea M, Yener A. The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II: Multiple Library Files. In 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018. Institute of Electrical and Electronics Engineers Inc. 2019. p. 989-996. 8635931. (2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018). https://doi.org/10.1109/ALLERTON.2018.8635931