Sage Journals: Discover world-class research

Abstract

An efficient protocol for establishing secret keys for neighboring nodes in a wireless network is presented in this paper. The security of the key generated by our protocol is based on the unpredictability of the noises in binary symmetric communication channels. The two nodes which try to establish a common secret key receive messages from a common source of random bit strings. Due to noises in the communication channel, the messages received by them, and most importantly the messages received by the eavesdropper, are not the same. We show that the two nodes can modify their messages in an efficient way to obtain a common string which contains enough uncertainty to the eavesdropper. Then, a secure universal hash function is applied to compute a secret key for extracting randomness from the common string. We prove that the probability for the eavesdropper to know the value of the key is negligible. One advantage of our proposed protocol is that the secret key rate is better than the known scheme in other models, such as the bounded storage model. Furthermore, our proposed protocol needs only to perform exclusive-or operations and compute hash values. Thus, it is a computationally light-weight protocol and suitable for devices with limited computing resources, such as sensors in sensor networks.

Keywords

Key agreement light-weight protocol wireless network random noise binary symmetric channel

Get full access to this article

View all access options for this article.

References

Z.K.

Adeyemo and

T.I.

Raji, Bit error rate analysis for wireless links using adaptive combining diversity, Journal of Theoretical and Applied Information Technology 20(1) (2010), 58–65.

Ahmadi and

Safavi-Naini, Secret keys from channel noise, in: Advances in Cryptology: Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011, Springer-Verlag, Berlin, 2011, pp. 266–283.

Aono,

Higuchi,

Ohira,

Komiyama and

Sasaoka, Wireless secret key generation exploiting reactance-domain scalar response of multipath fading channels, IEEE Transactions on Antennas and Propagation, 53(11) (2005), 3776–3784. doi:10.1109/TAP.2005.858853.

Azimi-Sadjadi,

Kiayias,

Mercado and

Yener, Robust key generation from signal envelopes in wireless networks, in: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS ’07, ACM, New York, NY, USA, 2007, pp. 401–410. doi:10.1145/1315245.1315295.

C.H.

Bennett,

Brassard,

Crepeau and

U.M.

Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory 41(6) (1995), 1915–1923. doi:10.1109/18.476316.

K.-Y.

Cheong and

Miyaji, Unconditionally secure oblivious transfer based on channel delays, in: Proceedings of the 13th International Conference on Information and Communications Security, ICICS 2011, Springer-Verlag, Berlin, 2011, pp. 112–120.

Crépeau, Efficient cryptographic protocols based on noisy channels, in: Advances in Cryptology: Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT ’97, Springer-Verlag, Berlin, 1997, pp. 306–317.

Crepeau and

Kilian, Achieving oblivious transfer using weakened security assumptions (extended abstract), in: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 42–52.

Crepeau,

Morozov and

Wolf, Efficient unconditional oblivious transfer from almost any noisy channel, in: Proceedings of Fourth Conference on Security in Communication Networks, SCN ’04, Springer-Verlag, 2004, pp. 47–59.

10.

Eschenauer and

V.D.

Gligor, A key-management scheme for distributed sensor networks, in: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS ’02, ACM, New York, NY, USA, 2002, pp. 41–47.

11.

A.A.

Hassan,

W.E.

Stark,

J.E.

Hershey and

Chennakeshu, Cryptographic key agreement for mobile radio, Digital Signal Processing 6(4) (1996), 207–212. doi:10.1006/dspr.1996.0023.

12.

Imai,

Morozov and

A.C.A.

Nascimento, On the oblivious transfer capacity of the erasure channel, in: 2006 IEEE International Symposium on Information Theory, 2006, pp. 1428–1431. doi:10.1109/ISIT.2006.262082.

13.

Jana,

S.N.

Premnath,

Clark,

S.K.

Kasera,

Patwari and

S.V.

Krishnamurthy, On the effectiveness of secret key extraction from wireless signal strength in real environments, in: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, MobiCom ’09, ACM, New York, NY, USA, 2009, pp. 321–332.

14.

Koorapaty,

A.A.

Hassan and

Chennakeshu, Secure information transmission for mobile radio, IEEE Communications Letters, 4(2) (2000), 52–55. doi:10.1109/4234.824754.

15.

Liu and

Ning, Establishing pairwise keys in distributed sensor networks, in: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS ’03, ACM, New York, NY, USA, 2003, pp. 52–61. doi:10.1145/948109.948119.

16.

Mathur,

Trappe,

Mandayam,

Ye and

Reznik, Radio-telepathy: Extracting a secret key from an unauthenticated wireless channel, in: Proceedings of the 14th Annual International Conference on Mobile Computing and Networking, MobiCom ’08, 2008, ACM, New York, NY, USA, pp. 128–139.

17.

M.J.

Miller and

N.H.

Vaidya, Leveraging channel diversity for key establishment in wireless sensor networks, in: Proceedings of the 25th IEEE International Conference on Computer Communications, INFOCOM 2006, 2006, pp. 1–12.

18.

Palmieri and

Pereira, Building oblivious transfer on channel delays, in: Proceedings of the 6th International Conference on Information Security and Cryptology, Inscrypt 2010, Springer-Verlag, Berlin, 2011, pp. 125–138. doi:10.1007/978-3-642-21518-6_10.

19.

Ren,

Zeng and

Lou, A new approach for random key pre-distribution in large-scale wireless sensor networks, Wireless Communication and Mobile Computing 6(3) (2006), 307–318. doi:10.1002/wcm.397.

20.

S.-C.

Tsai,

W.-G.

Tzeng and

K.-Y.

Zhou, Key establishment schemes against storage-bounded adversaries in wireless sensor networks, IEEE Transactions on Wireless Communications 8(3) (2009), 1218–1222. doi:10.1109/TWC.2009.081048.

21.

U.E.

Uyoata and

J.M.

Noras, BER performance of 2x2 and 4x4 transmit diversity MIMO in downlink LTE, International Journal of Computer Applications 108(9) (2014), 23–28. doi:10.5120/18941-9693.

22.

Wilson,

Tse and

R.A.

Scholtz, Channel identification: Secret sharing using reciprocity in ultrawideband channels, IEEE Transactions on Information Forensics and Security 2(3) (2007), 364–375. doi:10.1109/TIFS.2007.902666.

23.

A.D.

Wyner, The wire-tap channel, Bell System Technical Journal 54(8) (1975), 1355–1387. doi:10.1002/j.1538-7305.1975.tb02040.x.

A secret key establishment protocol for wireless networks using noisy channels

Abstract

Keywords

Get full access to this article

References