Secure Decentralized Pliable Index Coding

Tuninetti, Daniela

doi:10.1109/isit44484.2020.9173957

Cited by 9 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pliable index coding [37] is a variant of index coding in which terminals are required to decode not a specific source message, but any message they do not already have as side information, a flexibility implying significant rate advantages when compared to traditional index coding. Various forms of security in the context of index coding and pliable index-coding have been studied, e.g., in [41]- [44].…”

Section: A Related Workmentioning

confidence: 99%

Network Coding Multicast Key-Capacity

Langberg¹,

Effros²

2022

Preprint

View full text Add to dashboard Cite

For a multi-source multi-terminal noiseless network, the key-dissemination problem involves the task of multicasting a secret key K from the network sources to its terminals. As in secure multicast network-coding, in the key-dissemination problem the source nodes have access to independent randomness and, as the network is noiseless, the resulting key K is a function of the sources' information. However, different from traditional forms of multicast, in key-dissemination the key K need not consist of source messages, but rather may be any function of the information generated at the sources, as long as it is shared by all terminals. Allowing the shared key K to be a mixture of source information grants a flexibility to the communication process which gives rise to the potential of increased key-rates when compared to traditional secure multicast. The multicast key-capacity is the supremum of achievable key-rates, subject to the security requirement that the shared key is not revealed to an eavesdropper with predefined eavesdropping capabilities. The key-dissemination problem (termed also, secret key-agreement) has seen significant studies over the past decades in memoryless network structures. In this work, we initiate the study of keydissemination in the context of noiseless networks, i.e., network coding. In this context, we study similarities and differences between traditional secure-multicast and the more lenient task of key-dissemination. I. INTRODUCTIONA key-dissemination communication protocol is one in which a key K, which is at times secret, is shared among a collection of users as a prelude to future communication tasks requiring shared user common knowledge. The task of key dissemination (termed also, secret key-agreement) has seen significant studies over the past decades in memoryless network structures, e.g., [1]- [12] in which a collection of nodes wish to share a common key over a noisy network structure which is subject to eavesdropping. Typical network structures in the studies above include a broadcast channel enhanced with a public noiseless-channel, where the key is generated at the source node and the eavesdropper has both noisy access to the broadcasted information and noiseless access to the public channel. Remarkably, the public channel improves on the achievable key rate despite being completely exposed to eavesdropping.This work initiates the study of key-dissemination in the context of noiseless networks, i.e., in the context of Network Coding.

show abstract

Section: A Related Workmentioning

confidence: 99%

Network Coding Multicast Key-Capacity

Langberg¹,

Effros²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Pliable index coding [38] is a variant of index coding in which terminals are required to decode not a specific source message, but any message they do not already have as side information, a flexibility implying significant rate advantages when compared to traditional index coding. Various forms of security in the context of index coding and pliable index-coding have been studied, e.g., in [42]- [45].…”

Section: A Related Workmentioning

confidence: 99%

Network Coding Multicast Key-Capacity

Langberg

Effros

2022

2022 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

For a multi-source multi-terminal noiseless network, the key-dissemination problem involves the task of multicasting a secret key K from the network sources to its terminals. As in secure multicast network-coding, in the key-dissemination problem the source nodes have access to independent randomness and, as the network is noiseless, the resulting key K is a function of the sources' information. However, different from traditional forms of multicast, in key-dissemination the key K need not consist of source messages, but rather may be any function of the information generated at the sources, as long as it is shared by all terminals. Allowing the shared key K to be a mixture of source information grants a flexibility to the communication process which gives rise to the potential of increased key-rates when compared to traditional secure multicast. The multicast key-capacity is the supremum of achievable key-rates, subject to the security requirement that the shared key is not revealed to an eavesdropper with predefined eavesdropping capabilities. The key-dissemination problem (termed also, secret key-agreement) has seen significant studies over the past decades in memoryless network structures. In this work, we initiate the study of keydissemination in the context of noiseless networks, i.e., network coding. In this context, we study similarities and differences between traditional secure-multicast and the more lenient task of key-dissemination. I. INTRODUCTIONA key-dissemination communication protocol is one in which a key K, which is at times secret, is shared among a collection of users as a prelude to future communication tasks requiring shared user common knowledge. The task of key dissemination (termed also, secret key-agreement) has seen significant studies over the past decades in memoryless network structures, e.g., [1]- [13] in which a collection of nodes wish to share a common key over a noisy network structure which is subject to eavesdropping. Typical network structures in the studies above include a broadcast channel enhanced with a public noiseless-channel, where the key is generated at the source node and the eavesdropper has both noisy access to the broadcasted information and noiseless access to the public channel. Remarkably, the public channel improves on the achievable key rate despite being completely exposed to eavesdropping.This work initiates the study of key-dissemination in the context of noiseless networks, i.e., in the context of Network Coding.

show abstract

“…Converse techniques were further developed in [10], [11], using which the optimal lengths of specific classes of PICOD problems were obtained. Other extensions of PICOD such as vector pliable index codes [7], multiple requests [6], [7], secure pliable index codes [12] and decentralized pliable index codes [13] have also been studied recently.…”

Section: Introductionmentioning

confidence: 99%

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

Krishnan¹,

Mathew²,

Kalyanasundaram³

2021

Preprint

View full text Add to dashboard Cite

In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requests a new message which it does not have. The goal of the server is to do this using as few transmissions as possible.This work presents a hypergraph coloring approach to the PICOD problem. A conflict-free coloring of a hypergraph is known from literature as an assignment of colors to its vertices so that each edge of the graph contains one uniquely colored vertex. For a given PICOD problem represented by a hypergraph consisting of messages as vertices and request-sets as edges, we present achievable PICOD schemes using conflict-free colorings of the PICOD hypergraph. Various graph theoretic parameters arising out of such colorings (and some new variants) then give a number of upper bounds on the optimal PICOD length, which we study in this work. Our achievable schemes based on hypergraph coloring include scalar as well as vector linear PICOD schemes. For the scalar case, using the correspondence with conflict-free coloring, we show the existence of an achievable scheme which has length O(log 2 Γ),where Γ refers to a parameter of the hypergraph that captures the maximum 'incidence' number of other edges on any edge. This result improves upon known achievability results in PICOD literature, in some parameter regimes.

show abstract

Secure Decentralized Pliable Index Coding

Cited by 9 publications

References 11 publications

Network Coding Multicast Key-Capacity

Network Coding Multicast Key-Capacity

Network Coding Multicast Key-Capacity

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

Contact Info

Product

Resources

About