9,015 research outputs found
The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation
The problem of simultaneously generating a secret key (SK) and private key
(PK) pair among three terminals via public discussion is investigated, in which
each terminal observes a component of correlated sources. All three terminals
are required to generate a common secret key concealed from an eavesdropper
that has access to public discussion, while two designated terminals are
required to generate an extra private key concealed from both the eavesdropper
and the remaining terminal. An outer bound on the SK-PK capacity region was
established in [1], and was shown to be achievable for one case. In this paper,
achievable schemes are designed to achieve the outer bound for the remaining
two cases, and hence the SK-PK capacity region is established in general. The
main technique lies in the novel design of a random binning-joint decoding
scheme that achieves the existing outer bound.Comment: 20 pages, 4 figure
Secret Key Agreement under Discussion Rate Constraints
For the multiterminal secret key agreement problem, new single-letter lower
bounds are obtained on the public discussion rate required to achieve any given
secret key rate below the secrecy capacity. The results apply to general source
model without helpers or wiretapper's side information but can be strengthened
for hypergraphical sources. In particular, for the pairwise independent
network, the results give rise to a complete characterization of the maximum
secret key rate achievable under a constraint on the total discussion rate
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit
The multiterminal secret key agreement problem by public discussion is
formulated with an additional source compression step where, prior to the
public discussion phase, users independently compress their private sources to
filter out strongly correlated components for generating a common secret key.
The objective is to maximize the achievable key rate as a function of the joint
entropy of the compressed sources. Since the maximum achievable key rate
captures the total amount of information mutual to the compressed sources, an
optimal compression scheme essentially maximizes the multivariate mutual
information per bit of randomness of the private sources, and can therefore be
viewed more generally as a dimension reduction technique. Single-letter lower
and upper bounds on the maximum achievable key rate are derived for the general
source model, and an explicit polynomial-time computable formula is obtained
for the pairwise independent network model. In particular, the converse results
and the upper bounds are obtained from those of the related secret key
agreement problem with rate-limited discussion. A precise duality is shown for
the two-user case with one-way discussion, and such duality is extended to
obtain the desired converse results in the multi-user case. In addition to
posing new challenges in information processing and dimension reduction, the
compressed secret key agreement problem helps shed new light on resolving the
difficult problem of secret key agreement with rate-limited discussion, by
offering a more structured achieving scheme and some simpler conjectures to
prove
On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model
Communication complexity refers to the minimum rate of public communication
required for generating a maximal-rate secret key (SK) in the multiterminal
source model of Csiszar and Narayan. Tyagi recently characterized this
communication complexity for a two-terminal system. We extend the ideas in
Tyagi's work to derive a lower bound on communication complexity in the general
multiterminal setting. In the important special case of the complete graph
pairwise independent network (PIN) model, our bound allows us to determine the
exact linear communication complexity, i.e., the communication complexity when
the communication and SK are restricted to be linear functions of the
randomness available at the terminals.Comment: A 5-page version of this manuscript will be submitted to the 2014
IEEE International Symposium on Information Theory (ISIT 2014
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
- …