#### DMCA

## Threshold Constraints on Symmetric Key Extraction from Rician . . . (2012)

Venue: | IEEE TRANSACTIONS ON MOBILE COMPUTING |

Citations: | 1 - 1 self |

### Citations

3818 | A Method for Obtaining Digital Signatures and Public Key Cryptosystems
- Rivest, Shamir, et al.
- 1978
(Show Context)
Citation Context ...re the public key is not secret and is used to encrypt information. Decryption can only be performed using a private key which is secretly kept. A prominent example is the Rivest-Shamir-Adleman (RSA) =-=[2]-=- algorithm. Both types of encryption methods are based on security by complexity and provide adequate security to date. Symmetric methods are characterized by lower algorithmic complexity, while asymm... |

3466 | M.: New directions in cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ...o compensate for its weak encryption strength. To this end, a method of securely establishing a symmetric encryption key is needed. A prominent method used in practice is the Diffie-Hellman algorithm =-=[4]-=- which reintroduces high algorithmic complexity. Implementing these traditional cryptographic methods involves the use of considerable online computation power, memory space and communication overhead... |

1189 |
Communication theory of secrecy systems
- Shannon
- 1948
(Show Context)
Citation Context ...of the work presented in this paper. We assume that the reciprocal bit extraction method being used is designed such that maximal key entropy is achieved, i.e., all possible keys are equally probable =-=[31]-=-. This means that the probability for any generated key bit to be zero or one is the same. This could translate to performing nonuniform quantization depending on the probability density function of t... |

1119 | Wireless communications - Goldsmith - 2005 |

374 |
The Design of Rijndael: AES - The Advanced Encryption Standard
- Daemen, Rijmen
- 2002
(Show Context)
Citation Context ...tems, a large predeployed secret key is shared by the two communicating parties. The same key is used to encrypt and decrypt information. A prominent example is the advanced encryption standard (AES) =-=[1]-=-, where a 128 bit key is typically used. Asymmetric encryption is based on public-key cryptography where the public key is not secret and is used to encrypt information. Decryption can only be perform... |

200 | On the Secrecy Capacity of Fading Channels
- Gopala, Lai, et al.
- 2008
(Show Context)
Citation Context ...on computational complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], [7], [8], =-=[9]-=-, [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [... |

185 | Secure Communication over Fading Channels
- Liang, Poor, et al.
- 2008
(Show Context)
Citation Context ...], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], =-=[16]-=-, [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reci... |

181 | A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications - Rukhin, Soto, et al. - 2001 |

153 | Wireless InformationTheoretic Security
- Bloch, Barros, et al.
- 2008
(Show Context)
Citation Context ... methods based on computational complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see =-=[6]-=-, [7], [8], [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13]... |

116 | Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
- Mathur, Trappe, et al.
- 2008
(Show Context)
Citation Context ...amples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], =-=[22]-=-, [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band c... |

92 |
Improving wireless physical layer security via cooperating relays
- Dong, Han, et al.
- 2010
(Show Context)
Citation Context ...ional complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], [7], [8], [9], [10], =-=[11]-=-, [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [... |

85 | Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
- Wilson, Tse, et al.
- 2007
(Show Context)
Citation Context ...], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], =-=[17]-=-, [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal... |

69 | A study of the energy consumption characteristics of cryptographic algorithms and security protocols
- Potlapally, Ravi, et al.
- 2006
(Show Context)
Citation Context ...l devices, compact mobile devices, and wireless enabled bio-sensors. The costs associated with securing a wireless link in resource-constrained devices received considerable attention in the past—see =-=[5]-=- for example. A low-complexity alternative for establishing a symmetric key is attractive provided that it is authenticated and secure from eavesdropping. Such an alternative would allow the use of lo... |

64 | Secret key extraction from wireless signal strength in real environments
- Premnath, Jana, et al.
(Show Context)
Citation Context .... In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], =-=[23]-=-, [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel... |

57 | Space-Time Wireless Channels - Durgin - 2002 |

54 |
Unconventional cryptographic keying variable management
- Hershey, Hassan, et al.
- 1995
(Show Context)
Citation Context ...[7], [8], [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], =-=[14]-=-, [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction b... |

49 | Information-theoretically secret key generation for fading wireless channels
- Ye, Mathur, et al.
- 2010
(Show Context)
Citation Context ...] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], =-=[19]-=-, [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantizatio... |

34 |
High-rate uncorrelated bit extraction for shared secret key generation from channel measurements
- Patwari, Croft, et al.
(Show Context)
Citation Context ...ddition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], =-=[24]-=-, [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel estim... |

29 | Robust beamforming for security in MIMO wiretap channels with imperfect CSI
- Mukherjee, Swindlehurst
- 2011
(Show Context)
Citation Context ...ased on computational complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], [7], =-=[8]-=-, [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [1... |

29 | Using the physical layer for wireless authentication in time-variant channels
- Xiao, Greenstein, et al.
- 2008
(Show Context)
Citation Context ...n, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], =-=[25]-=-, [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel estimates s... |

28 |
Secure information transmission for mobile radio
- Koorapaty, Hassan, et al.
- 2000
(Show Context)
Citation Context ...8], [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], =-=[15]-=-, [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based o... |

25 |
Novel sum-ofsinusoids simulation models for Rayleigh and Rician fading channels
- Xiao, Zheng, et al.
- 2006
(Show Context)
Citation Context ...mes wide-sense stationary scattering from uncorrelated scatterers and is widely used to evaluate practical propagation environments. Our analysis makes use of the Rician channel simulator reported in =-=[29]-=-, the National Institute of Science and Technology (NIST) random number generator statistical test suite [30], and a supporting lemma we define and prove. The simulator in [29] offers high accuracy wi... |

21 | Proximate: Proximity-based secure pairing using ambient wireless signals
- Mathur, Miller, et al.
- 2011
(Show Context)
Citation Context ...depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], =-=[28]-=- and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel estimates such as those repor... |

17 | Secured communication over frequency-selective fading channels: A practical Vandermonde precoding
- Kobayashi, Debbah, et al.
- 2009
(Show Context)
Citation Context ...complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], [7], [8], [9], [10], [11], =-=[12]-=- for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [... |

17 | Automatic secret keys from reciprocal mimo wireless channels: Measurement and analysis
- Wallace, Sharma
- 2010
(Show Context)
Citation Context ...ent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], =-=[21]-=-, [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-... |

15 |
Maximal ratio diversity combining enhanced security
- He, Man, et al.
- 2011
(Show Context)
Citation Context ...mputational complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], [7], [8], [9], =-=[10]-=-, [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [... |

11 | Channelbased detection of Sybil attacks in wireless networks
- Xiao, Greenstein, et al.
- 2009
(Show Context)
Citation Context ...ature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], =-=[27]-=-, [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel estimates such as those... |

10 |
Secret key establishment using temporally and spatially correlated wireless channel coefficients
- Chen, Jensen
- 2011
(Show Context)
Citation Context ...], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], =-=[18]-=-, [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quant... |

8 | Securing OFDM over Wireless Time-Varying Channels using Sub-Carrier Over-Loading with Joint Signal Constellations
- Tsouri, Wulich
- 2009
(Show Context)
Citation Context ... [6], [7], [8], [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see =-=[13]-=-, [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extrac... |

7 | Channel-based spoofing detection in frequencyselective Rayleigh channels
- Xiao, Greenstein, et al.
(Show Context)
Citation Context ... literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], =-=[26]-=-, [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of narrow-band channel estimates such as... |

5 | Billet (Eds.), New Stream Cipher Designs – the eSTREAM Finalists - Robshaw, O - 2008 |

4 | Narayan B Mandayam, Wade Trappe, “ Using the Physical layer for Wireless Authentication in Time-Variant Channels - Xiao, Greenstein - 2008 |

3 | Reliable Symmetric Key Generation for Body Area Networks Using Wireless Physical Layer Security in the Presence of an On-Body Eavesdropper
- Tsouri, Wilczewski
- 2011
(Show Context)
Citation Context ...prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14], [15], [16], [17], [18], [19], =-=[20]-=-, [21], [22], [23], [24], [25], [26], [27], [28] and references therein for examples. We focus our attention on low-complexity methods of symmetric key extraction based on reciprocal quantization of n... |

2 | Sneha Kumar Kasera HighRate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements - Patwari, Croft, et al. - 2010 |

1 |
Secrecy Capacity for Satellite Networks under Rain Fading
- Petraki, Anastasopoulus, et al.
- 2011
(Show Context)
Citation Context ...ods based on computational complexity. Previous work on the secrecy capacity of wireless fading channels showed they have an intrinsic property of concealing information from an eavesdropper—see [6], =-=[7]-=-, [8], [9], [10], [11], [12] for prominent examples. In addition, the literature depicts many attempts to practically use the secrecy-capacity to implement information theoretic security—see [13], [14... |

1 |
Cipher Designs - The eSTREAM
- Stream
- 2008
(Show Context)
Citation Context ...orithmic complexity, while asymmetric methods are characterized by lower key management complexity. To minimize complexity, one could use a simpler symmetric encryption method such as a stream cipher =-=[3]-=- coupled with periodic key establishing to compensate for its weak encryption strength. To this end, a method of securely establishing a symmetric encryption key is needed. A prominent method used in ... |

1 |
Tsouri received the BSc, MSc, and PhD degrees in electrical and computer engineering from Ben-Gurion
- Hall
- 2013
(Show Context)
Citation Context ...channel parameters. 2.1 Proximity Attacks We use the time-based model given in [29] to describe the varying channel in space. This is justified due to the channel duality between space and time [32], =-=[33]-=-. We use the following variable translation between space and time: d fDt; ð1Þ where d is distance in meters from an arbitrary reference point, is the wavelength associated with the frequency of... |