#### DMCA

## Wireless information-theoretic security - part I: Theoretical aspects (2006)

### Cached

### Download Links

- [www.dcc.fc.up.pt]
- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Trans. on Information Theory |

Citations: | 162 - 12 self |

### Citations

3537 | New directions in cryptography - Diffie, Hellman - 1976 |

1526 | Fundamentals of wireless communication - Tse - 2005 |

1262 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 1973
(Show Context)
Citation Context ...viewed as a special case of source coding with side-information, where Alice compresses her source X n and Bob decodes it with the help of correlated side information Y n M . The Slepian-Wolf theorem =-=[22]-=- yields a lower bound on the total number of bits Mrec which have to be exchanged: Mrec ≥ H(X n |Y n M) = nH(X|YM). (3) Notice that the result of [22] only applies to discrete random variables whereas... |

1227 |
Communication theory of secrecy systems
- Shannon
- 1949
(Show Context)
Citation Context ...oded by a third party maliciously eavesdropping on the wireless medium (see Fig. 1). The theoretical basis for this information-theoretic approach, which builds on Shannon’s notion of perfect secrecy =-=[4]-=-, was laid by Wyner [5] and later by Csiszár and Körner [6], who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of ... |

980 |
Quantum Cryptography: Public key distribution and coin tossing",
- Bennett, Brassard
- 1984
(Show Context)
Citation Context ...e made about the information that is leaked to the eavesdropper as a function of channel quality and blocklength of the messages [11]; • Has been realized in practice through quantum key distribution =-=[33]-=-; • In theory, suitably long codes used for privacy amplification can get exponentially close to perfect secrecy [11]; • Instead of distributing keys it is possible to generate on-the-fly as many secr... |

845 |
Universal classes of hash functions
- Carter, Wegman
- 1979
(Show Context)
Citation Context ...e, such that the eavesdroppers obtains negligible information about the final k-bit sequence g(S). In practice this can be achieved by choosing g at random within a universal family of hash functions =-=[23]-=-, as stated in the following theorem. Theorem 1: [16, Corollary 4] Let S ∈ {0,1} nrec be the random variable representing the bit sequence shared by Alice and Bob, and let E be the random variable rep... |

753 |
Broadcast channels with confidential messages
- Csiszár, Körner
- 1978
(Show Context)
Citation Context ...less medium (see Fig. 1). The theoretical basis for this information-theoretic approach, which builds on Shannon’s notion of perfect secrecy [4], was laid by Wyner [5] and later by Csiszár and Körner =-=[6]-=-, who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of data confidentiality. A general setup for the so called wir... |

588 | Design of capacity-approaching irregular low-density parity-check codes
- Richardson, Shokrollahi, et al.
- 2001
(Show Context)
Citation Context ...ed. In this case the probability of decoding error is the same for linear LDPC codes and LDPC coset codes, which allows us to use linear LDPC codes designed with the standard density evolution method =-=[34]-=-. This property no more holds when decoding the following levels, however recent results suggest that linear LDPC codes may still perform well with our coset coding scheme [35]. In order to further si... |

580 |
The wire-tap channel
- Wyner
- 1975
(Show Context)
Citation Context ...aliciously eavesdropping on the wireless medium (see Fig. 1). The theoretical basis for this information-theoretic approach, which builds on Shannon’s notion of perfect secrecy [4], was laid by Wyner =-=[5]-=- and later by Csiszár and Körner [6], who proved in seminal papers that there exist channel codes guaranteeing both robustness to transmission errors and a prescribed degree of data confidentiality. A... |

558 |
Bit-Interleaved Coded Modulation,”
- Caire, Taricco, et al.
- 1998
(Show Context)
Citation Context ...ation scheme, where Alice would transmit her data over a Gaussian channel using a PulseAmplitude-Modulation scheme. Most standard modulation techniques such as Bit Interleaved Coded Modulation (BICM) =-=[29]-=- or MultiLevel Coding/MultiStage Decoding (MLC/MSD) [30] schemes can therefore be adapted to reconciliation. In the case of a BICM-like reconciliation, a single syndrome would be computed based on an ... |

491 |
Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes,"
- Brink
- 2001
(Show Context)
Citation Context ...ng into account multiple iterations between levels make it possible to maintain a good efficiency. The practical code rate assignment is based on an analysis of the decoding process using EXIT charts =-=[36]-=-. Although there exist no theoretical results associated with EXIT charts for the Gaussian channel, they are a convenient tool to predict the exchange of information between the demappers and decoders... |

432 | Secret key agreement by public discussion from common information
- Maurer
- 1993
(Show Context)
Citation Context ... public-key cryptography, which was to be adopted by nearly all contemporary security schemes. More recently, information-theoretic security witnessed a renaissance arguably due to the work of Maurer =-=[9]-=-, who proved that even when the legitimate users (say Alice and Bob) have a worse channel than the eavesdropper (say Eve), it is possible for them to generate a secret key through public communication... |

426 | Fading channels: information-theoretic and communications aspects
- Biglieri, Proakis, et al.
- 1998
(Show Context)
Citation Context ... wiretap channels has not received much attention and there is no larger framework to draw on, even with the sustained advances in the area coding and modulation for Gaussian and fading channels [4], =-=[5]-=-. Much of previous work for the wiretap channel stems from the early work [6] and [7] and studied more extensively by Wei [8]. This work shows how to encode secret information using cosets of certain ... |

417 |
New Hash Functions and Their Use in Authentication and Set Equality,” J. Comput Syst Sci
- Wegman, Carter
- 1981
(Show Context)
Citation Context ...ncertainty on the key is greater than k − 2 −r0 /ln 2 with probability 1 − 2 −s . For our protocol in this paper we do not develop anything new, and we use standard families of hash 7sfunctions [23], =-=[26]-=-. 4. Secure communication. The secret key generated K = G(S) can finally be used to secure Alice’s message, using either a one-time pad for perfect secrecy or a standard secret key encryption algorith... |

393 |
Wireless communications – principles and practice. 2nd edn. Prentice Hall Communications Engineering and Emerging Technologies Series.
- Rappaport
- 2002
(Show Context)
Citation Context ...lice and Bob, distance dW between Alice and Eve, and pathloss exponent α, we have that 1 P(Cs > 0) = 1 + (dM/dW) α Proof: The corollary follows directly from the fact that γM ∝ 1/dα M and γW ∝ 1/dα W =-=[29]-=-. Remark 1: Note that when γM ≫ γW (or dM ≪ dW ) then P(Cs > 0) ≈ 1 (or P(Cs = 0) ≈ 0). Conversely, when γW ≫ γM (or dW ≪ dM) then P(Cs > 0) ≈ 0 (or P(Cs = 0) ≈ 1). It is also interesting to observe t... |

365 |
The Gaussian wiretap channel
- Leung-Yan-Cheong, Hellman
- 1978
(Show Context)
Citation Context ...ensuring that an eavesdropper, say Eve, is unable to obtain any information from the outputs of the wiretap channel. to degraded versions of the channel outputs that reach the legitimate receiver. In =-=[7]-=- it was shown that if both the main channel and the wiretap channel are additive white Gaussian noise (AWGN) channels, and the latter has less capacity than the former, the secrecy capacity (i.e. the ... |

323 | Generalized privacy amplification
- Bennett, Brassard, et al.
- 1995
(Show Context)
Citation Context ...te memoryless channels yields the same secrecy rates as the weaker condition in [5] and [6]. A key ingredient for secret key generation over noisy channels is privacy amplification (see Bennett et al =-=[11]-=-), which provides Alice and Bob with the means to distill perfectly secret symbols (e.g. a secret key) from a large set of only partially secret data. This general approach is used and modified in Par... |

305 | Common randomness in information theory and cryptography—I: Secret sharing
- Ahlswede, Csiszár
- 1993
(Show Context)
Citation Context ...ver wireless channels. The key generation/distribution problem in wiretap channels falls under the general problem of key generation from correlated source outputs, which has been studied [13], [14], =-=[15]-=- in an information theoretic context. The objective of secure key distribution is for Alice and 2sBob to agree on a common k-bit key about which Eve’s entropy is maximal. In key distribution, the k bi... |

209 | Compression of binary sources with side information at the decoder using LDPC codes,
- Liveris, Xiong, et al.
- 2002
(Show Context)
Citation Context ...binary LDPC component codes. Other classes of codes such as Turbo-Codes could be used as well, however LDPC have already proved their good performance for error-correction and side information coding =-=[31]-=-, and the Belief-Propagation algorithm can easily be generalized to account for the correlation between the sub-sequences {ℓk(xi)} i=0...n−1 (k ∈ {0... m − 1}). We use the following notations to descr... |

207 | Multilevel codes: theoretical concepts and practical design rules,”
- Wachsmann, Fischer, et al.
- 1999
(Show Context)
Citation Context ... Gaussian channel using a PulseAmplitude-Modulation scheme. Most standard modulation techniques such as Bit Interleaved Coded Modulation (BICM) [29] or MultiLevel Coding/MultiStage Decoding (MLC/MSD) =-=[30]-=- schemes can therefore be adapted to reconciliation. In the case of a BICM-like reconciliation, a single syndrome would be computed based on an interleaved version of the bit sequence {ℓk(xi)} i=0...n... |

186 | Secure communication over fading channels”
- Liang, Poor, et al.
- 2009
(Show Context)
Citation Context ...o-noise ratio (SNR) than the legitimate receiver— without the need for public communication over a feedback channel. The ergodic secrecy capacity of fading channels was soon derived by Liang and Poor =-=[14]-=-, and, independently, by Li et al. [15]. Power and rate allocation schemes for secret communication over fading channels were presented by Gopala et al. in [16]. Secure broadcasting over wireless chan... |

184 |
Recent results in the Shannon Theory,”
- Wyner
- 1974
(Show Context)
Citation Context ...cribed by a m-bit label (m ≥ log 2 |X |), we introduce the m labeling functions ℓk : X → {0,1} (k ∈ {0... m − 1}), which associate to any element of X the kth bit of its binary label. As suggested in =-=[28]-=-, we can then use the syndromes of {ℓk(xi)} i=0...n−1 k=0...m−1 according to a binary code as the additional information sent by Alice to Bob. Because of the particular correlation considered here, th... |

161 | Discrete memoryless interference and broadcast channels with confidential messages: Secrecy rate regions
- Liu, Maric, et al.
- 2008
(Show Context)
Citation Context ...ailed study of the multiple access channel with secrecy constraints between users was provided by Liang and Poor in [24]. Liu et al presented results for the same problem in [25] and, investigated in =-=[26]-=- also broadcast and interference channels with confidential messages. The Gaussian multiple access channel with an eavesdropper was studied in [27]. A. Our Contributions Motivated by the general probl... |

157 | Secret-Key Reconciliation by Public Discussion,”
- Brassard, Salvail
- 1994
(Show Context)
Citation Context ...he optimization. Clearly, Nc should be large enough so that I(X;YM) can approach CM within the required precision, its exact choice will be discussed in the Section III. 2. Information reconciliation =-=[21]-=-. The channel noise introduces discrepancies between Bob’s received symbols Y n M and Alice’s symbols Xn . The first step is for Bob to estimate Alice’s symbols ˆ Xn = � ˆX1,... , ˆ � Xn based on Y n ... |

148 |
Modulation and coding for linear Gaussian channels
- Forney, Ungerboeck
- 1998
(Show Context)
Citation Context ...ading wiretap channels has not received much attention and there is no larger framework to draw on, even with the sustained advances in the area coding and modulation for Gaussian and fading channels =-=[4]-=-, [5]. Much of previous work for the wiretap channel stems from the early work [6] and [7] and studied more extensively by Wei [8]. This work shows how to encode secret information using cosets of cer... |

134 |
Generalized Hamming weights for linear codes,
- Wei
- 1991
(Show Context)
Citation Context ...es in the area coding and modulation for Gaussian and fading channels [4], [5]. Much of previous work for the wiretap channel stems from the early work [6] and [7] and studied more extensively by Wei =-=[8]-=-. This work shows how to encode secret information using cosets of certain linear block codes. More recently, this general notion has been extended by Thangaraj et al. [9] where it was shown how low d... |

125 | Information-Theoretic key agreement: From weak to strong secrecy for free,” ser
- Maurer, Wolf
- 2000
(Show Context)
Citation Context ... (say Alice and Bob) have a worse channel than the eavesdropper (say Eve), it is possible for them to generate a secret key through public communication over an insecure yet authenticated channel. In =-=[10]-=- Maurer and Wolf showed that a stronger (and technically more convincing) secrecy condition for discrete memoryless channels yields the same secrecy rates as the weaker condition in [5] and [6]. A key... |

113 | Secrecy capacity of wireless channels,” in
- Barros, Rodrigues
- 2006
(Show Context)
Citation Context ... Miguel R. D. Rodrigues is with the Computer Laboratory, University of Cambridge, United Kingdom. Parts of this work have been presented at the IEEE International Symposium on Information Theory 2006 =-=[1]-=-, at the 44th Allerton conference on Communication Control and Computing [2], and at the IEEE Information Theory Wokshop 2006 in Chengdu [3]. November 23, 2006 DRAFT 1sI. INTRODUCTION The issues of pr... |

110 | The Gaussian multiple access wire-tap channel,”
- Tekin, Yener
- 2008
(Show Context)
Citation Context ...ts for the same problem in [25] and, investigated in [26] also broadcast and interference channels with confidential messages. The Gaussian multiple access channel with an eavesdropper was studied in =-=[27]-=-. A. Our Contributions Motivated by the general problem of securing transmissions over wireless channels, we consider the impact of fading on the secrecy capacity. Our contributions in Part I are as f... |

104 | Secrecy capacities for multiple terminals
- Csiszár, Narayan
- 2004
(Show Context)
Citation Context ...retic secret key agreement over wireless channels were reported by Imai et al in [21]. Secrecy systems with multiple users have also recently become an object of intense research. Csiszár and Narayan =-=[22]-=- presented the fundamental limits of secret key generation in multi-terminal setups. Secret key constructions for this problem are reported by Ye and Narayan in [23]. A detailed study of the multiple ... |

91 | Multiple access channels with confidential messages,”
- Liang, Poor
- 2008
(Show Context)
Citation Context ...ret key constructions for this problem are reported by Ye and Narayan in [23]. A detailed study of the multiple access channel with secrecy constraints between users was provided by Liang and Poor in =-=[24]-=-. Liu et al presented results for the same problem in [25] and, investigated in [26] also broadcast and interference channels with confidential messages. The Gaussian multiple access channel with an e... |

87 |
The Wire-Tap Channel,” The Bell System
- Wyner
- 1975
(Show Context)
Citation Context ...ework to draw on, even with the sustained advances in the area coding and modulation for Gaussian and fading channels [4], [5]. Much of previous work for the wiretap channel stems from the early work =-=[6]-=- and [7] and studied more extensively by Wei [8]. This work shows how to encode secret information using cosets of certain linear block codes. More recently, this general notion has been extended by T... |

77 | Universal hashing and authentication codes.
- Stinson
- 1994
(Show Context)
Citation Context ...X|YM) + (1 − β)I(X;YM)〉 D ≈ 〈H(X) − βCM〉 D additional bits per symbols on average. The 17 (19) (20)sminimum size of a universal familiy of hash functions G : {0,1} nrec → {0,1} k is at least 2 nrec−k =-=[38]-=- and privacy amplication therefore requires the transmission of nrec −k bits. No hashing scheme is known to achieve this bound for any nrec, therefore we will consider the more realistic situation whe... |

74 | Privacy and Authentication for Wireless Local Area Networks”
- Aziz, Diffie
- 1994
(Show Context)
Citation Context ...systems is zero; • State-of-the art key distribution schemes for wireless networks based on the computational model require a trusted third party as well as complex protocols and system architectures =-=[32]-=-. The advantages of physical layer security under the information-theoretic (perfect) security models can be summarized as follows: • No computational restrictions are placed on the eavesdropper; • Ve... |

69 |
Secrecy capacity of SIMO and slow fading channels,” in
- Parada, Blahut
- 2005
(Show Context)
Citation Context ...sian and quasi-static fading wiretap channel. In [12], Hero introduced space-time signal processing techniques for secure communication over 3 Bob Eveswireless links. More recently, Parada and Blahut =-=[13]-=- considered the secrecy capacity of various degraded fading channels. In a shorter prelude to some of the results in this paper [1], Barros and Rodrigues provided the first characterization of the out... |

62 | Secure space-time communication,”
- Hero
- 2003
(Show Context)
Citation Context ...arge set of only partially secret data. This general approach is used and modified in Part II of this paper to develop efficient protocols for the Gaussian and quasi-static fading wiretap channel. In =-=[12]-=-, Hero introduced space-time signal processing techniques for secure communication over 3 Bob Eveswireless links. More recently, Parada and Blahut [13] considered the secrecy capacity of various degra... |

61 |
Secrecy Capacity of Independent Parallel Channels,” in
- Li, Yates, et al.
- 2006
(Show Context)
Citation Context ... receiver— without the need for public communication over a feedback channel. The ergodic secrecy capacity of fading channels was soon derived by Liang and Poor [14], and, independently, by Li et al. =-=[15]-=-. Power and rate allocation schemes for secret communication over fading channels were presented by Gopala et al. in [16]. Secure broadcasting over wireless channels is considered in [17]. Practical s... |

58 | Unconditionally secure key agreement and the intrinsic conditional information - Maurer, Wolf - 1999 |

48 | The discrete memoryless multiple access channel with confidential messages,” in
- Liu, Maric, et al.
- 2006
(Show Context)
Citation Context ...and Narayan in [23]. A detailed study of the multiple access channel with secrecy constraints between users was provided by Liang and Poor in [24]. Liu et al presented results for the same problem in =-=[25]-=- and, investigated in [26] also broadcast and interference channels with confidential messages. The Gaussian multiple access channel with an eavesdropper was studied in [27]. A. Our Contributions Moti... |

39 | Linking information reconciliation and privacy amplification - Cachin, Maurer - 1997 |

35 |
Extracting secrecy from jointly Gaussian random variables,”
- Ye, Reznik, et al.
- 2006
(Show Context)
Citation Context ...by Bloch et al. [19] to be useful tools for reconciliation of correlated continuous random variables, with implications in quantum key distribution. A related scheme was presented by Ye and Reznik in =-=[20]-=-. Experimental results supporting the possibility of informationtheoretic secret key agreement over wireless channels were reported by Imai et al in [21]. Secrecy systems with multiple users have also... |

29 |
Secret key agreement from correlated source outputs using low density parity check matrices
- Muramatsu
- 2006
(Show Context)
Citation Context ...for reliability and security requirements of the wiretap channel. Existence of coding schemes for various generalized wiretap channel scenarios has been proved by several authors recently [10], [11], =-=[12]-=-. In particular, the existence of coding methods based on LDPC codes has been shown in [12]. Since designing wiretap codes for Gaussian and fading channels appears to be beyond the capabilities of cur... |

25 | Reconciliation of a quantumdistributed Gaussian key
- Assche, Cardinal, et al.
- 2004
(Show Context)
Citation Context ...een Alice and Bob to arrive at a common but secret key [13], where they exchange information by way of a parallel, error-free public channel between Alice and Bob during the key agreement phase (e.g. =-=[17]-=-). One key advance in this paper is that we focus exclusively on protocols that require only one-way, feed-forward communication from Alice to Bob across the noisy wireless channel and there is no nee... |

17 | Secret key and private key constructions for simple multiterminal source models
- Ye, Narayan
- 2005
(Show Context)
Citation Context ...ense research. Csiszár and Narayan [22] presented the fundamental limits of secret key generation in multi-terminal setups. Secret key constructions for this problem are reported by Ye and Narayan in =-=[23]-=-. A detailed study of the multiple access channel with secrecy constraints between users was provided by Liang and Poor in [24]. Liu et al presented results for the same problem in [25] and, investiga... |

17 |
LDPCbased secret key agreement over the Gaussian wiretap channels
- Bloch, Thangaraj, et al.
- 2006
(Show Context)
Citation Context ... Miguel R. D. Rodrigues is with the Computer Laboratory, University of Cambridge, United Kingdom. Parts of this work have been presented at the IEEE International Symposium on Information Theory 2006 =-=[1]-=-, at the 44th Allerton conference on Communication Control and Computing [2], and at the IEEE Information Theory Wokshop 2006 in Chengdu [3]. November 24, 2006 DRAFT 1sI. INTRODUCTION Part I of this t... |

15 |
Some New Results for Integrals Involving the Generalised Marcum Q Function and Their Application to Performance Evaluation Over Fading Channels
- Simon, Alouini
- 2003
(Show Context)
Citation Context ... < γW |γW) = 1 − Q1 γW/(¯γW σ2 ), � γW/(¯γWσ 2 ) � where Q1(·, ·) is the generalized Marcum Q function [30]. Moreover, using standard results for integrals involving the generalized Marcum Q function =-=[31]-=-, the upper bound to the outage probability reduces to Pout ≤ 1 2 1 1 − � . (10) 2 1 + 2/σ2 19sIt is also relevant to characterize two other quantities with operational significance: the average secur... |

13 |
Capacity of power constrained memoryless awgn channels with fixed input constellations
- Varnica, Kavcic
- 2002
(Show Context)
Citation Context ...hundredth of bits of the channel capacity CM even with a discrete distribution. For a fixed number of constellation points Nc = |X |, this optimization can be performed with the algorithm proposed in =-=[20]-=-, however a very good approximation of the optimum can simply be obtained by expanding a uniformly spaced amplitude shift keying (ASK) constellation {xi} = i=1...Nc � ±1, ±3,... , ± Nc−1 � 2 by a fact... |

13 |
efficient error reconciliation for quantum cryptography, Phys
- Buttler, Peterson, et al.
- 2003
(Show Context)
Citation Context ...an efficient reconciliation approach for Step 2 of the key agreement. The reconciliation of binary random variables has been extensively studied and several efficient methods have been proposed [21], =-=[27]-=-, however little attention has been devoted to the practical reconciliation of non-binary random variables [17]. As stated previously the goal is given a non-binary variable X with distribution given ... |

10 | Secure broadcasting with multiuser diversity,” presented at
- Khisti, Tchamkerten, et al.
- 2006
(Show Context)
Citation Context ...by Li et al. [15]. Power and rate allocation schemes for secret communication over fading channels were presented by Gopala et al. in [16]. Secure broadcasting over wireless channels is considered in =-=[17]-=-. Practical secrecy capacity-achieving codes for erasure channels were presented by Thangaraj et al. in [18]. LDPC codes were also shown by Bloch et al. [19] to be useful tools for reconciliation of c... |

9 |
The wire-tap
- Wyner
- 1975
(Show Context)
Citation Context ... draw on, even with the sustained advances in the area coding and modulation for Gaussian and fading channels [4], [5]. Much of previous work for the wiretap channel stems from the early work [6] and =-=[7]-=- and studied more extensively by Wei [8]. This work shows how to encode secret information using cosets of certain linear block codes. More recently, this general notion has been extended by Thangaraj... |

8 |
G.: Noisy Cryptographic Protocols for Low-Cost RFID Tags
- Chabanne, Fumaroli
- 2006
(Show Context)
Citation Context ...from Alice to Bob and NW > NM. There are a number of practical scenarios where this assumption is valid, for example radio frequency identification (RFID) tags and readers with a passive eavesdropper =-=[19]-=-. Although the secrecy capacity of the Gaussian wiretap channel has been fully characterized [18], designing practical coding schemes is still an open problem. On the other hand, previous results on s... |

7 | Capacity achieving codes for the wiretap channel with applications to quantum key distribution
- Thangaraj, Dihidar, et al.
- 2004
(Show Context)
Citation Context ...ented by Gopala et al. in [16]. Secure broadcasting over wireless channels is considered in [17]. Practical secrecy capacity-achieving codes for erasure channels were presented by Thangaraj et al. in =-=[18]-=-. LDPC codes were also shown by Bloch et al. [19] to be useful tools for reconciliation of correlated continuous random variables, with implications in quantum key distribution. A related scheme was p... |

6 |
Exponent of channel resolvability and wire-tapped channel,”
- Hayashi
- 2004
(Show Context)
Citation Context ...can be used for reliability and security requirements of the wiretap channel. Existence of coding schemes for various generalized wiretap channel scenarios has been proved by several authors recently =-=[10]-=-, [11], [12]. In particular, the existence of coding methods based on LDPC codes has been shown in [12]. Since designing wiretap codes for Gaussian and fading channels appears to be beyond the capabil... |

6 | Slepian-Wolf code design via sourcechannel correspondence
- Chen, He, et al.
(Show Context)
Citation Context ...n the levels might help improve the performance of the 10soverall scheme. These practical issues will be discussed in the next section. Let us finally point out that the algorithms described in [32], =-=[33]-=-, [31] can all be viewed as special cases of this general algorithm. B. Rate Assignment The optimal code rates required for each sub-sequence {ℓk(xi)} i=0...n−1 are those required for MultiStage Decod... |

5 |
An opportunistic physical-layer approach to secure wireless communications
- Bloch, Barros, et al.
- 2006
(Show Context)
Citation Context ...idge, United Kingdom. Parts of this work have been presented at the IEEE International Symposium on Information Theory 2006 [1], at the 44th Allerton conference on Communication Control and Computing =-=[2]-=-, and at the IEEE Information Theory Wokshop 2006 in Chengdu [3]. November 23, 2006 DRAFT 1sI. INTRODUCTION The issues of privacy and security in wireless communication networks have taken on an incre... |

5 | On the possibility of key agreement using variable directional antenna
- Imai, Kobara, et al.
(Show Context)
Citation Context ...lated scheme was presented by Ye and Reznik in [20]. Experimental results supporting the possibility of informationtheoretic secret key agreement over wireless channels were reported by Imai et al in =-=[21]-=-. Secrecy systems with multiple users have also recently become an object of intense research. Csiszár and Narayan [22] presented the fundamental limits of secret key generation in multi-terminal setu... |

3 | Efficient reconciliation of correlated continuous random variables using ldpc codes
- Bloch, Thangaraj, et al.
- 2005
(Show Context)
Citation Context ...ng over wireless channels is considered in [17]. Practical secrecy capacity-achieving codes for erasure channels were presented by Thangaraj et al. in [18]. LDPC codes were also shown by Bloch et al. =-=[19]-=- to be useful tools for reconciliation of correlated continuous random variables, with implications in quantum key distribution. A related scheme was presented by Ye and Reznik in [20]. Experimental r... |

3 |
non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wire-tap channel
- “General
- 2006
(Show Context)
Citation Context ... used for reliability and security requirements of the wiretap channel. Existence of coding schemes for various generalized wiretap channel scenarios has been proved by several authors recently [10], =-=[11]-=-, [12]. In particular, the existence of coding methods based on LDPC codes has been shown in [12]. Since designing wiretap codes for Gaussian and fading channels appears to be beyond the capabilities ... |

2 | On the typicality of the linear code among the LDPC coset code ensemble
- Wang, Kulkarni, et al.
- 2005
(Show Context)
Citation Context ...ensity evolution method [34]. This property no more holds when decoding the following levels, however recent results suggest that linear LDPC codes may still perform well with our coset coding scheme =-=[35]-=-. In order to further simplify the code design, we used irregular LDPC codes optimized for antipodal signaling over the AWGN channel as component codes. The block length used was 200,000 and graphs we... |

1 |
On the secrecy capacity of fading channels,” 2006, preprint available at http://arxiv.org/abs/cs.IT/0610103
- Gopala, Lai, et al.
(Show Context)
Citation Context ...nels was soon derived by Liang and Poor [14], and, independently, by Li et al. [15]. Power and rate allocation schemes for secret communication over fading channels were presented by Gopala et al. in =-=[16]-=-. Secure broadcasting over wireless channels is considered in [17]. Practical secrecy capacity-achieving codes for erasure channels were presented by Thangaraj et al. in [18]. LDPC codes were also sho... |

1 |
On novel applications of ldpc codes to the wiretap channel,” Submitted to
- Thangaraj, Dihidar, et al.
- 2006
(Show Context)
Citation Context ...died more extensively by Wei [8]. This work shows how to encode secret information using cosets of certain linear block codes. More recently, this general notion has been extended by Thangaraj et al. =-=[9]-=- where it was shown how low density parity check codes can asymptotically achieve the secrecy capacity for the erasure wiretap channel, and how it can be used to provide perfectly secret communication... |

1 |
Improved decoding of ldpc coded modulations
- Nana, Sharon, et al.
- 2006
(Show Context)
Citation Context ...between the levels might help improve the performance of the 10soverall scheme. These practical issues will be discussed in the next section. Let us finally point out that the algorithms described in =-=[32]-=-, [33], [31] can all be viewed as special cases of this general algorithm. B. Rate Assignment The optimal code rates required for each sub-sequence {ℓk(xi)} i=0...n−1 are those required for MultiStage... |