On the secrecy capacity of distributed storage with locality and availability

Stanislav Kruglik, Pavel Rybin, Alexey Frolov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    In this paper, we extend the notion of locally recoverable codes with availability to secret sharing schemes. The main problem that we considered is how to store information using locally recoverable codes with all symbol locality and availability in such way that useful information can be recovered using an only small subset of coordinates while a user who observes less than a certain number of coordinates does not get any information. In other words, we have to protect locally recoverable codes with availability over passive eavesdropper that can observe only limited number of coordinates. Upper bounds on number of bits that can be securely stored in such systems together with explicit constructions of codes with such a property are proposed.

    Original languageEnglish
    Title of host publication2019 IEEE 90th Vehicular Technology Conference, VTC 2019 Fall - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781728112206
    DOIs
    Publication statusPublished - Sep 2019
    Event90th IEEE Vehicular Technology Conference, VTC 2019 Fall - Honolulu, United States
    Duration: 22 Sep 201925 Sep 2019

    Publication series

    NameIEEE Vehicular Technology Conference
    Volume2019-September
    ISSN (Print)1550-2252

    Conference

    Conference90th IEEE Vehicular Technology Conference, VTC 2019 Fall
    Country/TerritoryUnited States
    CityHonolulu
    Period22/09/1925/09/19

    Fingerprint

    Dive into the research topics of 'On the secrecy capacity of distributed storage with locality and availability'. Together they form a unique fingerprint.

    Cite this