Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Secure Partial Repair in Wireless Caching Networks with Broadcast Channels
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7926-5081
2015 (English)In: 2015 IEEE Conference on Communications and NetworkSecurity, CNS 2015, 2015, 353-360 p., 7346846Conference paper, Published paper (Refereed)
Abstract [en]

We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. Let us denote a caching node that has lost parts of its stored packets as a sick caching node and a caching node that has not lost any packet as a healthy caching node. In partial repair, a set of caching nodes ( among sick and healthy caching nodes) broadcast information to other sick caching nodes to recover the erased packets. The broadcast information from a caching node is assumed to be received without any error by all other caching nodes. All the sick caching nodes then are able to recover their erased packets, while using the broadcast information and the non-erased packets in their storage as side information. In this setting, if an eavesdropper overhears the broadcast channels, it might obtain some information about the stored file. We thus study secure partial repair in the senses of information-theoretically strong and weak security. In both senses, we investigate the secrecy caching capacity, namely, the maximum amount of information which can be stored in the caching network such that there is no leakage of information during a partial repair process. We then deduce the strong and weak secrecy caching capacities, and also derive the sufficient finite field sizes for achieving the capacities. Finally, we propose optimal secure codes for exact partial repair, in which the recovered packets are exactly the same as erased packets.

Place, publisher, year, edition, pages
2015. 353-360 p., 7346846
Keyword [en]
Broadcasting, Codes (symbols), Information theory, Recovery, Repair, Amount of information, Broadcast channels, Finite fields, No leakages, Repair process, Secure codes, Side information
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-172853DOI: 10.1109/CNS.2015.7346846ISI: 000380401800044Scopus ID: 2-s2.0-84966372742ISBN: 978-1-4673-7876-5 (print)OAI: oai:DiVA.org:kth-172853DiVA: diva2:850202
Conference
3rd IEEE International Conference on Communications and Network Security, CNS 2015; Florence; Italy; 28 September 2015 through 30 September 2015
Note

QC 20160401

Available from: 2015-09-01 Created: 2015-09-01 Last updated: 2016-09-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusIEEE Conference on Communications and Network Security (CNS)

Authority records BETA

Xiao, MingSkoglund, Mikael

Search in DiVA

By author/editor
Gerami, MajidXiao, MingSalimi, SomayehSkoglund, Mikael
By organisation
Communication TheoryCommunication Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf