Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Secure Partial Repair in Wireless Caching Networks with Broadcast Channels
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.ORCID-id: 0000-0002-5407-0835
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.ORCID-id: 0000-0002-7926-5081
2015 (Engelska)Ingår i: 2015 IEEE Conference on Communications and NetworkSecurity, CNS 2015, 2015, s. 353-360, artikel-id 7346846Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
2015. s. 353-360, artikel-id 7346846
Nyckelord [en]
Broadcasting, Codes (symbols), Information theory, Recovery, Repair, Amount of information, Broadcast channels, Finite fields, No leakages, Repair process, Secure codes, Side information
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:kth:diva-172853DOI: 10.1109/CNS.2015.7346846ISI: 000380401800044Scopus ID: 2-s2.0-84966372742ISBN: 978-1-4673-7876-5 (tryckt)OAI: oai:DiVA.org:kth-172853DiVA, id: diva2:850202
Konferens
3rd IEEE International Conference on Communications and Network Security, CNS 2015; Florence; Italy; 28 September 2015 through 30 September 2015
Anmärkning

QC 20160401

Tillgänglig från: 2015-09-01 Skapad: 2015-09-01 Senast uppdaterad: 2016-09-26Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopusIEEE Conference on Communications and Network Security (CNS)

Personposter BETA

Xiao, MingSkoglund, Mikael

Sök vidare i DiVA

Av författaren/redaktören
Gerami, MajidXiao, MingSalimi, SomayehSkoglund, Mikael
Av organisationen
KommunikationsteoriKommunikationsnät
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 74 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf