The caching broadcast channel with a wire and cache tapping adversary of type II

Mohamed Nafea, Aylin Yener

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

2 Citations (Scopus)

Abstract

This paper introduces the notion of cache-tapping into information theoretic models of coded caching. In particular, the wiretap II model with two receivers equipped with fixed-size cache memories is considered. The adversary chooses a set of symbols from cache placement, delivery, or both to tap into. The legitimate parties know neither whether cache placement, delivery, or both transmissions are tapped, nor the positions of tapped symbols. Only the size of overall tapped set is known. The strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified for the instance of two library files. Achievability is established using a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. The study overall demonstrates that information theoretic security guarantees are possible against a powerful adversary which optimizes its attack over both phases of a cache-aided communication system.

Original languageEnglish (US)
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538635995
DOIs
StatePublished - Jan 15 2019
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: Nov 25 2018Nov 29 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018

Conference

Conference2018 IEEE Information Theory Workshop, ITW 2018
CountryChina
CityGuangzhou
Period11/25/1811/29/18

Fingerprint

Wire
Cache memory
Security of data
Communication systems

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this

Nafea, M., & Yener, A. (2019). The caching broadcast channel with a wire and cache tapping adversary of type II. In 2018 IEEE Information Theory Workshop, ITW 2018 [8613490] (2018 IEEE Information Theory Workshop, ITW 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2018.8613490
Nafea, Mohamed ; Yener, Aylin. / The caching broadcast channel with a wire and cache tapping adversary of type II. 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. (2018 IEEE Information Theory Workshop, ITW 2018).
@inproceedings{6078d0d022f544dda737b28e16e73259,
title = "The caching broadcast channel with a wire and cache tapping adversary of type II",
abstract = "This paper introduces the notion of cache-tapping into information theoretic models of coded caching. In particular, the wiretap II model with two receivers equipped with fixed-size cache memories is considered. The adversary chooses a set of symbols from cache placement, delivery, or both to tap into. The legitimate parties know neither whether cache placement, delivery, or both transmissions are tapped, nor the positions of tapped symbols. Only the size of overall tapped set is known. The strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified for the instance of two library files. Achievability is established using a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. The study overall demonstrates that information theoretic security guarantees are possible against a powerful adversary which optimizes its attack over both phases of a cache-aided communication system.",
author = "Mohamed Nafea and Aylin Yener",
year = "2019",
month = "1",
day = "15",
doi = "10.1109/ITW.2018.8613490",
language = "English (US)",
series = "2018 IEEE Information Theory Workshop, ITW 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",
address = "United States",

}

Nafea, M & Yener, A 2019, The caching broadcast channel with a wire and cache tapping adversary of type II. in 2018 IEEE Information Theory Workshop, ITW 2018., 8613490, 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc., 2018 IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, 11/25/18. https://doi.org/10.1109/ITW.2018.8613490

The caching broadcast channel with a wire and cache tapping adversary of type II. / Nafea, Mohamed; Yener, Aylin.

2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. 8613490 (2018 IEEE Information Theory Workshop, ITW 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

AU - Nafea, Mohamed

AU - Yener, Aylin

PY - 2019/1/15

Y1 - 2019/1/15

N2 - This paper introduces the notion of cache-tapping into information theoretic models of coded caching. In particular, the wiretap II model with two receivers equipped with fixed-size cache memories is considered. The adversary chooses a set of symbols from cache placement, delivery, or both to tap into. The legitimate parties know neither whether cache placement, delivery, or both transmissions are tapped, nor the positions of tapped symbols. Only the size of overall tapped set is known. The strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified for the instance of two library files. Achievability is established using a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. The study overall demonstrates that information theoretic security guarantees are possible against a powerful adversary which optimizes its attack over both phases of a cache-aided communication system.

AB - This paper introduces the notion of cache-tapping into information theoretic models of coded caching. In particular, the wiretap II model with two receivers equipped with fixed-size cache memories is considered. The adversary chooses a set of symbols from cache placement, delivery, or both to tap into. The legitimate parties know neither whether cache placement, delivery, or both transmissions are tapped, nor the positions of tapped symbols. Only the size of overall tapped set is known. The strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified for the instance of two library files. Achievability is established using a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. The study overall demonstrates that information theoretic security guarantees are possible against a powerful adversary which optimizes its attack over both phases of a cache-aided communication system.

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

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

U2 - 10.1109/ITW.2018.8613490

DO - 10.1109/ITW.2018.8613490

M3 - Conference contribution

AN - SCOPUS:85062060477

T3 - 2018 IEEE Information Theory Workshop, ITW 2018

BT - 2018 IEEE Information Theory Workshop, ITW 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. In 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc. 2019. 8613490. (2018 IEEE Information Theory Workshop, ITW 2018). https://doi.org/10.1109/ITW.2018.8613490