Alternative Title

Providing Robust Certification Services against Active Attacks in Ad Hoc Networks

Publication Type

Conference Proceeding Article

Version

Preprint

Publication Date

4-2005

Abstract

Most of previous research work in key management can only resist passive attacks, such as dropping the certificate request, and are vulnerable under active attacks, such as returning a fake reply to the node requesting the certification service. In this paper, we propose two algorithms to address both security and efficiency issues of certification services in ad hoc networks. Both of the algorithms can resist active attacks. In addition, simulation results show that, compared to the previous works, our second algorithm is not only much faster in a friendly environment, but it also works well in a hostile environment in which existing schemes work poorly. Furthermore, the process of generating partial certificates in our second algorithm is extremely fast. Such advantage is critical in ad-hoc networks where by nature the less help a node requests from its neighbors, the higher is the chance of obtaining the help. Consequently, using our second algorithm, a node can easily find enough neighboring nodes which provide the certification service.

Keywords

Active attacks, Ad hoc networks, Certification service, Computer simulation, Security of data

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Proceedings of the 2005 IEEE International Performance, Computing, and Communications Conference: Phoenix, Arizona, April 7-9, 2005

First Page

285

Last Page

292

ISBN

9780780389915

Identifier

10.1109/PCCC.2005.1460571

Publisher

IEEE

City or Country

Piscataway, NJ

Copyright Owner and License

Authors

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1109/PCCC.2005.1460571

Share

COinS