A content-delivery protocol, exploiting the privacy benefits of coded caching

Felix Engelmann, P. Elia
{"title":"A content-delivery protocol, exploiting the privacy benefits of coded caching","authors":"Felix Engelmann, P. Elia","doi":"10.23919/WIOPT.2017.7959863","DOIUrl":null,"url":null,"abstract":"Coded caching is a communications technique that has elevated the preemptive use of memory (caching) into a powerful ingredient in general communications networks, promising to change the way networking and PHY-based communications are conducted. At the same time though — because this approach is heavily dependent on cooperation between the content provider (CP), and a centralized powerful transmitter of information (ISP), and because it is heavily dependent on users caching a variety of content that is not their own — raises privacy concerns which have the potential to compromise the applicability of coded caching. What we are showing in this early work here, is that in fact coded caching carries a distinct set of salient features that in fact boost privacy. We present a step-by-step privacy-aware content-delivery protocol that utilizes caching and which — at a small cost in performance — can safeguard against unauthorized matching of users to their requests, as well as against unauthorized knowledge of the popularity statistics of files; both crucial privacy issues in different scenarios such as video on demand. These properties include multicasting-only transmissions for continuous obfuscation of the true destination of content, an almost seamless addition of phantom users that can skew the true popularity distribution, popularity-agnostic caches, cache-agnostic ISP, and an overall minimization of data traffic between CP and ISP, and between ISP and users.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Coded caching is a communications technique that has elevated the preemptive use of memory (caching) into a powerful ingredient in general communications networks, promising to change the way networking and PHY-based communications are conducted. At the same time though — because this approach is heavily dependent on cooperation between the content provider (CP), and a centralized powerful transmitter of information (ISP), and because it is heavily dependent on users caching a variety of content that is not their own — raises privacy concerns which have the potential to compromise the applicability of coded caching. What we are showing in this early work here, is that in fact coded caching carries a distinct set of salient features that in fact boost privacy. We present a step-by-step privacy-aware content-delivery protocol that utilizes caching and which — at a small cost in performance — can safeguard against unauthorized matching of users to their requests, as well as against unauthorized knowledge of the popularity statistics of files; both crucial privacy issues in different scenarios such as video on demand. These properties include multicasting-only transmissions for continuous obfuscation of the true destination of content, an almost seamless addition of phantom users that can skew the true popularity distribution, popularity-agnostic caches, cache-agnostic ISP, and an overall minimization of data traffic between CP and ISP, and between ISP and users.
内容传递协议,利用编码缓存的隐私优势
编码缓存是一种通信技术,它将内存的抢先使用(缓存)提升为通用通信网络中的一个强大组成部分,有望改变网络和基于物理的通信的执行方式。与此同时,由于这种方法严重依赖于内容提供者(CP)和集中的强大的信息发送者(ISP)之间的合作,并且因为它严重依赖于用户缓存各种不是他们自己的内容,这引起了隐私问题,这有可能损害编码缓存的适用性。我们在早期的工作中展示的是,编码缓存实际上有一系列显著的特性,这些特性实际上可以提高隐私。我们提出了一个循序渐进的隐私感知内容交付协议,该协议利用缓存,并且-以较小的性能成本-可以防止未经授权的用户与其请求匹配,以及防止未经授权的文件流行统计数据;在视频点播等不同场景中,这两个都是至关重要的隐私问题。这些属性包括用于持续混淆内容的真实目的地的仅多播传输、几乎无缝地添加可以扭曲真实流行分布的虚拟用户、与流行无关的缓存、与缓存无关的ISP,以及将CP和ISP之间以及ISP和用户之间的数据流量总体最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信