| 1. |
- Babaheidarian, P., et al.
(författare)
-
Preserving confidentiality in the Gaussian broadcast channel using compute-and-forward
- 2017
-
Ingår i: 2017 51st Annual Conference on Information Sciences and Systems, CISS 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509047802
-
Konferensbidrag (refereegranskat)abstract
- We study the transmission of confidential messages across a wireless broadcast channel with K > 2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the asymmetric compute-and-forward decoding strategy to handle finite SNR regimes. Unlike previous alignment schemes, our achievable rates are attainable at any finite SNR value. Also, we show that our scheme achieves the optimal sum secure degrees of freedom of 1 for the K-receiver Gaussian broadcast channel with K confidential messages and K helpers.
|
|
| 2. |
- Gerami, Majid, et al.
(författare)
-
Optimal secure partial-repair in distributed storage systems
- 2017
-
Ingår i: 2017 51st Annual Conference on Information Sciences and Systems, CISS 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509047802
-
Konferensbidrag (refereegranskat)abstract
- Consider a distributed storage system where parts of the source file fragments in storage nodes are lost. We denote a storage node that lost a part of its fragments as a faulty storage node and a storage node that lost non of its fragment as a complete storage node. In a process, termed as partial repair, a set of storage nodes (among faulty and complete storage nodes) transmit repairing fragments to other faulty storage nodes to recover the lost fragments. We first investigate the optimal partial repair in which the required bandwidth for recovering the lost fragments is minimal. Next, we assume that an eavesdropper wiretaps a subset of links connecting storage nodes, and overhears a number of repairing fragments. We then study optimal secure partial-repair in which the partial-repair bandwidth is minimal and the eavesdropper obtains no information about the source file by overhearing the repairing fragments. We propose optimal secure codes for exact partial-repair in a special scenario.
|
|
| 3. |
|
|
