ACM Home Page
Please provide us with feedback. Feedback
Zero pre-shared secret key establishment in the presence of jammers
Full text PdfPdf (727 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing table of contents
New Orleans, LA, USA
SESSION: Secure communication table of contents
Pages 219-228  
Year of Publication: 2009
ISBN:978-1-60558-624-3
Authors
Tao Jin  Northeastern University, Boston, MA, USA
Guevara Noubir  Northeastern University, Boston, MA, USA
Bishal Thapa  Northeastern University, Boston, MA, USA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 37,   Downloads (12 Months): 147,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1530748.1530779
What is a DOI?

ABSTRACT

We consider the problem of key establishment over a wireless radio channel in the presence of a communication jammer, initially introduced in [13]. The communicating nodes are not assumed to pre-share any secret. The established key can later be used by a conventional spread-spectrum communication system. We introduce new communication concepts called intractable forward-decoding and efficient backward-decoding. Decoding under our mechanism requires at most twice the computation cost of the conventional SS decoding and one packet worth of signal storage. We introduce techniques that apply a key schedule to packet spreading and develop a provably optimal key schedule to minimize the bit-despreading cost. We also use efficient FFT-based algorithms for packet detection. We evaluate our techniques and show that they are efficient both in terms of resiliency against jammers and computation. Finally, our technique has additional features such as the inability to detect packet transmission until the last few bits are being transmitted, and transmissions being destination-specific. To the best of our knowledge, this is the first solution that is optimal in terms of communication energy cost with very little storage and computation overhead.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
E. Bayraktaroglu, C. King, X. Liu, G. Noubir, R. Rajaraman, and B. Thapa. On the performance of ieee 802.11 under jamming. In Infocom, 2008.
3
4
 
5
A. Chan, X. Liu, G. Noubir, and B. Thapa. Control channel jamming: Resilience and identification of traitors. In IEEE ISIT, 2007.
6
 
7
S. Gilbert, R. Guerraoui, and C. Newport. Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In OPODIS, 2006.
 
8
B. Gupta, S. Gupta, and S. Chang. Performance analysis of elliptic curve cryptography for ssl. In MobiCom, 2002.
 
9
M. Li, I. Koutsopoulos, and R. Poovendran. Optimal jamming attacks and network defense policies in wireless sensor networks. In INFOCOM, 2007.
 
10
11
 
12
 
13
 
14
P. Tague, D. Slater, G. Noubir, and R. Poovendran. Linear programming models for jamming attacks on network traffic flows. In WiOpt, 2008.
 
15
 
16
W. Xu, K. Ma, W. Trappe, and Y. Zhang. Jamming sensor networks: attack and defense strategies. In IEEE Network, 2006.

Collaborative Colleagues:
Tao Jin: colleagues
Guevara Noubir: colleagues
Bishal Thapa: colleagues