The Community for Technology Leaders
RSS Icon
Issue No.08 - Aug. (2013 vol.12)
pp: 1669-1680
Aldo Cassola , Northeastern University, Boston
Tao Jin , Northeastern University, Boston
Guevara Noubir , Northeastern University, Boston
Bishal Thapa , Northeastern University, Boston
Spread spectrum (SS) communication relies on the assumption that some secret is shared beforehand among communicating nodes to establish the spreading sequence for long-term wireless communication. Strasser et al. identified this as the circular dependency problem (CDP). This problem is exacerbated in large networks, where nodes join and leave the network frequently, and preconfiguration of secrets through physical contact is infeasible. In this work, we introduce an efficient and adversary-resilient secret sharing mechanism based on two novel paradigms (intractable forward decoding, efficient backward decoding) called Time Reversed Message Extraction and Key Scheduling (TREKS) that enables SS communication without preshared secrets. TREKS is four orders of magnitude faster than previous solutions to the CDP. Furthermore, our approach can be used to operate long-term SS communication without establishing any keys. The energy cost under TREKS is provably optimal with minimal storage overhead, and computation cost at most twice that of traditional SS. We evaluate TREKS through simulation and empirically using an experimental testbed consisting of USRP, GNU Radio, and GPU-equipped nodes. Using TREKS under a modest hardware setup, we can sustain a 1--Mbps long-term SS communication spread by a factor of 100 (i.e., 100 Megachips per second) over a 200-MHz bandwidth in real time.
Jamming, Receivers, Decoding, Cryptography, Spread spectrum communication, Mobile computing, Wireless communication, experimentation, Spread spectrum, zero preshared secret, antijamming, GNURadio, USRP
Aldo Cassola, Tao Jin, Guevara Noubir, Bishal Thapa, "Efficient Spread Spectrum Communication without Preshared Secrets", IEEE Transactions on Mobile Computing, vol.12, no. 8, pp. 1669-1680, Aug. 2013, doi:10.1109/TMC.2012.136
[1] T. Jin, G. Noubir, and B. Thapa, "Zero Pre-Shared Secret Key Establishment in the Presence of Jammers," Proc. ACM MobiHoc, 2009.
[2] M.K. Simon, J.K. Omura, R.A. Scholtz, and B.K. Levitt, Spread Spectrum Communications, vols. 1-3. CS Press, 1986.
[3] M. Strasser, C. Popper, S. Capkun, and M. Cagalj, "Jamming-Resistant Key Establishment Using Uncoordinated Frequency Hopping," Proc. IEEE Symp. Security and Privacy (ISSP), 2008.
[4] E. Bayraktaroglu, C. King, X. Liu, G. Noubir, R. Rajaraman, and B. Thapa, "On the Performance of IEEE 802.11 under Jamming," Proc. IEEE INFOCOM, 2008.
[5] G. Lin and G. Noubir, "On Link Layer Denial of Service in Data Wireless LANs," Wireless Comm. Mobile Computing, vol. 5, no. 3, pp. 273-284, 2005.
[6] M. Li, I. Koutsopoulos, and R. Poovendran, "Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2007.
[7] M.A. Bender, M. Farach-Colton, S. He, B.C. Kuszmaul, and C.E. Leiserson, "Adversarial Contention Resolution for Simple Channels," Proc. 17th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2005.
[8] B. Awerbuch, A. Richa, and C. Scheideler, "A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks," Proc. 27th ACM Symp. Principles of Distributed Computing (PODC), 2008.
[9] W. Xu, K. Ma, W. Trappe, and Y. Zhang, "Jamming Sensor Networks: Attack and Defense Strategies," IEEE Network, vol. 20, no. 3, pp. 41-47, May/June 2006.
[10] P. Tague, D. Slater, G. Noubir, and R. Poovendran, "Linear Programming Models for Jamming Attacks on Network Traffic Flows," Proc. Sixth Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops (WiOpt), 2008.
[11] J. Chiang and Y.-C. Hu, "Cross-Layer Jamming Detection and Mitigation in Wireless Broadcast Networks," Proc. ACM MobiCom, 2007.
[12] A. Chan, X. Liu, G. Noubir, and B. Thapa, "Control Channel Jamming: Resilience and Identification of Traitors," Proc. IEEE Symp. Information Theory (ISIT '07), 2007.
[13] P. Tague, M. Li, and R. Poovendran, "Probabilistic Mitigation of Control Channel Jamming via Random Key Distribution," Proc. IEEE 18th Ann. Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC), 2007.
[14] K.B. Rasmussen, S. Capkun, and M. Cagalj, "SecNav: Secure Broadcast Localization and Time Synchronization in Wireless Networks," Proc. ACM MobiCom, 2007.
[15] S. Gilbert, R. Guerraoui, and C. Newport, "Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks," Proc. Int'l Conf. Principles of Distributed Systems (OPODIS), 2006.
[16] M. Strasser, C. Popper, and S. Capkun, "Efficient Uncoordinated FHSS Anti-Jamming Communication," Proc. ACM MobiHoc, 2009.
[17] D. Slater, P. Tague, R. Poovendran, and B. Matt, "A Coding-Theoretic Approach for Efficient Message Verification Over Insecure Channels," Proc. ACM Second Conf. Wireless Network Security (WiSec), 2009.
[18] C. Popper, M. Strasser, and S. Capkun, "Jamming-Resistant Broadcast Communication without Shared Keys," Proc. USENIX Security Symp., 2009.
[19] J. Daemen and V. Rijmen, "The Rijndael Block Cipher," Rijndael-ammended.pdf, 2003.
[20] A. Bogdanov, D. Khovratovich, and C. Rechberger, "Biclique Cryptanalysis of the Full AES," cryptanalysisaesbc.pdf, 2011.
[21] Ettus Research, "Universal Software Radio Peripheral," https:/, 2013.
[22] NVIDIA, "Compute Unified Device Architecture." http:// , 2013.
[23] GNU Radio Project, "GNU Radio," https:/, 2013.
[24] NVIDIA, "Compute Unified Device Architecture Programming Guide v.2.2," html , 2009.
[25] A. Cassola, T. Jin, G. Noubir, and B. Thapa, "Spread Spectrum Communication without Any Pre-Shared Secret," technical report, trek.pdf, 2010.
[26] M. Frigo and S. Johnson, "The Design and Implementation of FFTW3," Proc. IEEE, vol. 93, no. 2, pp. 216-231, Feb. 2005.
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool