Secrecy Capacities for Multiple Terminals

Csiszár, Imre; Narayan, Paresh Kumar

doi:10.1109/tit.2004.838380

Cited by 379 publications

(788 citation statements)

References 8 publications

Supporting

Mentioning

780

Contrasting

Order By: Relevance

“…In [10], the authors study two related problems in the context of a collocated network. The first problem concerns "communication for omniscience" where the goal is to reconstruct all the sources rather than computing a function.…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Interactive Source Coding for Function Computation in Collocated Networks

Ishwar

Gupta³

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-A problem of interactive function computation in a collocated network is studied in a distributed block source coding framework. With the goal of computing samples of a desired function of sources at the sink, the source nodes exchange messages through a sequence of error-free broadcasts. For any function of independent sources, a computable characterization of the set of all feasible message coding rates-the rate region-is derived in terms of single-letter information measures. In the limit as the number of messages tends to infinity, the infinite-message minimum sum rate, viewed as a functional of the joint source probability mass function, is characterized as the least element of a partially ordered family of functionals having certain convex-geometric properties. This characterization leads to a family of lower bounds for the infinite-message minimum sum rate and a simple criterion to test the optimality of any achievable infinite-message sum rate. An iterative algorithm for evaluating the infinite-message minimum sum-rate functional is proposed and is demonstrated through an example of computing the minimum function of three Bernoulli sources. Based on the characterizations of the rate regions, it is shown that when computing symmetric functions of binary sources, the sink will inevitably learn certain additional information that is not demanded in computing the function. This conceptual understanding leads to new improved bounds for the minimum sum rate. The new bounds are shown to be orderwise better than those based on cut-sets as the network scales. The scaling law of the minimum sum rate is explored for different classes of symmetric functions and source parameters.

show abstract

Section: B Related Workmentioning

confidence: 99%

“…This contrasts sharply with the result proved in this paper where it is shown that the cut-set bound can be orderwise loose (see Section VI-D). The second problem studied in [10] concerns secret key generation. This is a very different problem in that there is a secrecy constraint and the public communication has unlimited capacity.…”

Section: B Related Workmentioning

confidence: 99%

Interactive Source Coding for Function Computation in Collocated Networks

Ishwar

Gupta³

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Such communication system may be viewed as a wire-tap channel with side information (which might be common randomness, i.e., a key at a certain rate). Other related work on this topic can be found in [31][32][33][34][35][36][37][38][39] and references therein. We 4 also remark that the secrecy rate/capacity has also been studied for the multiple access channel [40][41][42][43] the relay channel in [44], and the interference channel in [6].…”

Section: Introductionmentioning

confidence: 99%

Secure Communication Over Fading Channels

Liang

Poor

Shamai

2008

IEEE Trans. Inform. Theory

794

View full text Add to dashboard Cite

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derive that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

show abstract

“…(4) for any template T any shift (s v , s h ) and any observation x T . A template is a set of coordinate-pairs i.e.…”

Section: On the Entropy Of A Two-dimensional Stationary Processmentioning

confidence: 99%

“…As converse Corollary 1 to Theorem 1 in Maurer [6] applies. See also discussion in Csiszár and Narayan [4].…”

mentioning

confidence: 99%

Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting Method

Ignatenko¹,

Schrijen

Škorić

et al. 2006

2006 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-We propose methods to estimate the secrecy-rate of fuzzy sources (e.g. biometrics and Physical Unclonable Functions (PUFs)) using context-tree weighting (CTW, Willems et al. [1995]). In this paper we focus on PUFs. In order to show that our estimates are realistic we first generalize Maurer's [1993] result to the ergodic case. Then we focus on the fact that the entropy of a stationary two-dimensional structure is a limit of a series of conditional entropies, a result by Anastassiou and Sakrison [1982]. We extend this result to the conditional entropy of one two-dimensional structure given another one. Finally we show that the general CTW-method approaches the source entropy also in the two-dimensional stationary case. We further extend this result to the two-dimensional conditional entropy. Based on the obtained results we do several measurements on (our) optical PUFs. These measurements allow us to conclude that a secrecyrate of 0.3 bit/location is possible.

show abstract

Secrecy Capacities for Multiple Terminals

Cited by 379 publications

References 8 publications

Interactive Source Coding for Function Computation in Collocated Networks

Interactive Source Coding for Function Computation in Collocated Networks

Secure Communication Over Fading Channels

Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting Method

Contact Info

Product

Resources

About