Results 1  10
of
17
Wireless informationtheoretic security  part I: Theoretical aspects
 IEEE Trans. on Information Theory
, 2006
"... In this twopart paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an informationtheoretic problem formulation in which two legitimate partners communicate over a quasistatic fading channel and an eavesdropper observes their transmissi ..."
Abstract

Cited by 162 (12 self)
 Add to MetaCart
(Show Context)
In this twopart paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an informationtheoretic problem formulation in which two legitimate partners communicate over a quasistatic fading channel and an eavesdropper observes their transmissions through another independent quasistatic fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading informationtheoretic security is achievable even when the eavesdropper has a better average signaltonoise ratio (SNR) than the legitimate receiver — fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless informationtheoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.
Informationtheoretically secret key generation for fading wireless channels
 IEEE TRANS ON INFORMATION FORENSICS AND SECURITY
, 2010
"... The multipathrich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is timevarying, locationsensitive, and uniquely shared by a given transmitter–receiver pair. The complexity associated with a richly scattering environment i ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
(Show Context)
The multipathrich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is timevarying, locationsensitive, and uniquely shared by a given transmitter–receiver pair. The complexity associated with a richly scattering environment implies that the shortterm fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time, and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is wellsuited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a selfauthenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 b/s.
P.: When is a function securely computable
 IEEE Trans. Inf. Theory
, 2011
"... Abstract—A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be concealed from an eavesdropper with access to the communication. We show that the function is securely comp ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
(Show Context)
Abstract—A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be concealed from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the capacity of a new secrecy generationmodel, for which a singleletter characterization is provided. Index Terms—Aided secret key, balanced coloring lemma, function computation, maximum common function, omniscience, secret key capacity, secure computability. I.
Perfect omniscience, perfect secrecy, and Steiner tree packing
 IEEE TRANS. INF. THEORY
, 2010
"... We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a publi ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper. First, we show how the notion of perfect omniscience plays a central role in characterizing perfect secret key capacity. Second, a multigraph representation of the underlying secrecy model leads us to an efficient algorithm for perfect secret key generation based on maximal Steiner tree packing. This algorithm attains capacity when all the terminals seek to share a key, and, in general, attains at least half the capacity. Third, when a single “helper ” terminal assists the remaining “user ” terminals in generating a perfect secret key, we give necessary and sufficient conditions for the optimality of the algorithm; also, a “weak” helper is shown to be sufficient for optimality.
Group Secret Key Generation Algorithms
, 2007
"... Abstract — We consider a pairwise independent network where every pair of terminals in the network observes a common pairwise source that is independent of all the sources accessible to the other pairs. We propose a method for secret key agreement in such a network that is based on wellestablished ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We consider a pairwise independent network where every pair of terminals in the network observes a common pairwise source that is independent of all the sources accessible to the other pairs. We propose a method for secret key agreement in such a network that is based on wellestablished pointtopoint techniques and repeated application of the onetime pad. Three specific problems are investigated. 1) Each terminal’s observations are correlated only with the observations of a central terminal. All these terminals wish to generate a common secret key. 2) In a pairwise independent network, two designated terminals wish to generate a secret key with the help of other terminals. 3) All the terminals in a pairwise independent network wish to generate a common secret key. A separate protocol for each of these problems is proposed. Furthermore, we show that the protocols for the first two problems are optimal and the protocol for the third problem is efficient, in terms of the resulting secret key rates. I.
Secure Distributed Source Coding with SideInformation
"... Abstract — This letter develops codes for the scenario in which users with correlated messages are to encipher and compress their messages without collaboration and without the use of cryptographic keys or other secret materials. We consider an eavesdropper that has access to an encoded message and ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract — This letter develops codes for the scenario in which users with correlated messages are to encipher and compress their messages without collaboration and without the use of cryptographic keys or other secret materials. We consider an eavesdropper that has access to an encoded message and in addition, some sideinformation in the form of uncoded symbols corresponding to the encoded message. Our codes are an extension of distributed source coding using syndromes (DISCUS) with the additional requirement of providing secrecy for the scenario described above. We state a secrecy condition that the subcodes of DISCUS must satisfy, and develop a general encoding algorithm meeting these conditions. We analyze the performance of the proposed code for the case of multiple eavesdropped messages. Index Terms — Security, distributed source coding, ReedSolomon codes.
Common Randomness Principles of Secrecy
, 2013
"... This dissertation concerns the secure processing of distributed data by multiple terminals, using interactive public communication among themselves, in order to accomplish a given computational task. In the setting of a probabilistic multiterminal source model in which several terminals observe cor ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This dissertation concerns the secure processing of distributed data by multiple terminals, using interactive public communication among themselves, in order to accomplish a given computational task. In the setting of a probabilistic multiterminal source model in which several terminals observe correlated random signals, we analyze secure distributed data processing protocols that harness the correlation in the data. The specific tasks considered are: computing functions of the data under secrecy requirements; generating secretly shared bits with minimal rate of public communication; and securely sharing bits in presence of a querying eavesdropper. In studying these various secure distributed processing tasks, we adopt a unified approach that entails examining the form of underlying common randomness (CR) that is generated at the terminals during distributed processing. We make the case that the exact form of established CR is linked inherently to the data processing task at hand, and its characterization can lead to a structural understanding of the associated algorithms. An identification of the underlying CR and its decomposition into independent components, each with a different operational significance, is
The Capacity Region of the SourceType Model for Secret Key and Private Key Generation
"... Abstract — The problem of simultaneously generating a secret key (SK) and private key (PK) pair among three terminals via public discussion is investigated. In this problem, each terminal observes a component of correlated sources. All three terminals are required to generate the common SK to be con ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract — The problem of simultaneously generating a secret key (SK) and private key (PK) pair among three terminals via public discussion is investigated. In this problem, each terminal observes a component of correlated sources. All three terminals are required to generate the common SK to be concealed from an eavesdropper that has access to the public discussion, while two designated terminals are required to generate an extra PK to be concealed from both the eavesdropper and the remaining terminal. An outer bound on the SK–PK capacity region was established by Ye and Narayan, and was shown to be achievable for a special case. In this paper, the SK–PK capacity region is established in general by developing schemes to achieve the outer bound for the remaining two cases. The main technique lies in the novel design of a random binningjoint decoding scheme that achieves the existing outer bound. Index Terms — Secret key, private key, key capacity region, source model. I.
On the simulatability condition in key generation over a nonauthenticated public channel,” Submitted to
 IEEE Trans. Inform. Theory
, 2014
"... Abstract—Simulatability condition is a fundamental concept in studying key generation over a nonauthenticated public channel, in which Eve is active and can intercept, modify and falsify messages exchanged over the nonauthenticated public channel. Using this condition, Maurer and Wolf showed a rem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Simulatability condition is a fundamental concept in studying key generation over a nonauthenticated public channel, in which Eve is active and can intercept, modify and falsify messages exchanged over the nonauthenticated public channel. Using this condition, Maurer and Wolf showed a remarkable “all or nothing ” result: if the simulatability condition does not hold, the key capacity over the nonauthenticated public channel will be the same as that of the case with a passive Eve, while the key capacity over the nonauthenticated channel will be zero if the simulatability condition holds. However, two questions remain open so far: 1) For a given joint probability mass function (PMF), are there efficient algorithms (polynomial complexity algorithms) for checking whether the simulatability condition holds or not?; and 2) If the simulatability condition holds, are there efficient algorithms for finding the corresponding attack strategy? In this paper, we answer these two open questions affirmatively. In particular, for a given joint PMF, we construct a linear programming (LP) problem and show that the simulatability condition holds if and only if the optimal value obtained from the constructed LP is zero. Furthermore, we construct another LP and show that the minimizer of the newly constructed LP is a valid attack strategy. Both LPs can be solved with a polynomial complexity.