ACM Home Page
Please provide us with feedback. Feedback
Containing denial-of-service attacks in broadcast authentication in sensor networks
Full text PdfPdf (434 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing table of contents
Montreal, Quebec, Canada
SESSION: Sensor network security table of contents
Pages: 71 - 79  
Year of Publication: 2007
ISBN:978-1-59593-684-4
Authors
Ronghua Wang  Syracuse University, Syracuse, NY
Wenliang Du  Syracuse University, Syracuse, NY
Peng Ning  North Carolina State University, Raleigh, NC
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): 21,   Downloads (12 Months): 123,   Citation Count: 2
Additional Information:

abstract   references   cited by   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/1288107.1288118
What is a DOI?

ABSTRACT

Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on sensor nodes, these operations are expensive, which means sensor networks using PKC are susceptible to Denial of Service (DoS) attacks: attackers keep broadcasting bogus messages, which will incur extra costs, thus exhaust the energy of the honest nodes. In addition, the long time to verify each message using PKC increases the response time of the nodes; it is impractical for the nodes to validate each incoming message before forwarding i.

In this paper we discuss this type of DoS attacks, in which the goal of the adversary is to exhaust the energy of the sensor nodes and to increase their response time to broadcast messages. We then present a dynamic window scheme, where sensor nodes determine whether first to verify a message or first to forward the message by themselves. This is made possible with the information such as how far this node is away from the malicious attacker, and how many hops the incoming message has passed. We compare the performance of the proposed scheme with other schemes, and show that it can contain the damage of DoS attacks to only a small portion of the sensor nodes.


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
 
3
 
4
G. Gaubatz, J. Kaps, and B. Sunar. Public keys cryptography in sensor networks -- revisited. In Proceedings of ESAS 2004, 2004.
 
5
N. Gura, A. Patel, A. Wander, H. Eberle, and S. Shantz. Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs. In CHES 2004, Cambridge, MA, August 11-13 2004.
 
6
 
7
P. Ning and A. Liu. Tinyecc: Elliptic curve cryptography for sensor networks. Cyber Defense Laboratory in NCSU, September 2005.
 
8
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of NDSS, San Diego, CA, February 2001.
9
 
10
DARPA INTERNET PROGRAM. Rfc 793 -- transmission control protocol, September 1981.
11
12
13
 
14
 
15


Collaborative Colleagues:
Ronghua Wang: colleagues
Wenliang Du: colleagues
Peng Ning: colleagues