English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Index coding is concerned with efficient broadcast of a set of messages toreceivers in the presence of receiver side information. In this paper, we studythe secure index coding problem with security constraints on the receiversthemselves. That is, for each receiver there is a single legitimate message itneeds to decode and a prohibited message list, none of which should be decodedby that receiver. To this end, our contributions are threefold. We firstintroduce a secure linear coding scheme, which is an extended version of thefractional local partial clique covering scheme that was originally devised fornon-secure index coding. We then develop two information-theoretic bounds onthe performance of any valid secure index code, namely secure polymatroidalouter bound (on the capacity region) and secure maximum acyclic inducedsubgraph lower bound (on the broadcast rate). The structure of these boundsleads us to further develop two necessary conditions for a given index codingproblem to be securely feasible (i.e., to have nonzero rates).

Secure Index Coding with Security Constraints on Receivers