Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks 2003
DOI: 10.1145/986858.986866
|View full text |Cite
|
Sign up to set email alerts
|

A certificate revocation scheme for wireless ad hoc networks

Abstract: The increasing prominence of wireless ad hoc networks is stimulating greater interest in developing adequate security mechanisms for securing applications involving these innovative networks paradigms. To-date, the proposed security schemes either provide inadequate security or they are too costly computationally, and therefore impractical for most ad hoc network applications.Adapting wired network security schemes-particularly those involved digital certificates-to wireless ad hoc networks environments, poses… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 49 publications
(40 citation statements)
references
References 31 publications
0
40
0
Order By: Relevance
“…This work is based on their former work in [Hoeper and Gong 2006a], and the work of [Crepeau and Davis 2003;Luo et al 2002]. To enable key renewal in IBC schemes, they introduce a new format for ID-based public keys: Q i = H1(ID i ||t i ||v i ), where t i denotes the expiration date, and v i is the version number.…”
Section: · 21mentioning
confidence: 99%
“…This work is based on their former work in [Hoeper and Gong 2006a], and the work of [Crepeau and Davis 2003;Luo et al 2002]. To enable key renewal in IBC schemes, they introduce a new format for ID-based public keys: Q i = H1(ID i ||t i ||v i ), where t i denotes the expiration date, and v i is the version number.…”
Section: · 21mentioning
confidence: 99%
“…Given the limited amount of available evidence, vehicles rely on the assumption of honest majority and crosscheck all received accusations. In this paper, we use a simple algorithm, explained in detail in Appendix II.A, for summing accusations, with an additional feature inspired by [22]: An accusation issued by a node has a lower weight when this node is already accused by other participants. If the sum of weighted accusations (the eviction quotient) against a vehicle exceeds a defined threshold, it is locally evicted by LEAVE.…”
Section: A Neighbor Warning System For Leavementioning
confidence: 99%
“…However, this scheme considers the instantiation of the CA and not the problem of revocation, especially in the highly mobile VC environment. On the other hand, impromptu coalitions of network nodes (e.g., [3,8]) cannot be applicable in VC systems either. In fact, it would be unacceptable to allow to any small subset of adversarial nodes to maliciously accuse and evict legitimate nodes.…”
Section: Related Workmentioning
confidence: 99%