Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 411

The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.

SECTOR: secure tracking of node encounters in multi-hop wireless networks

Open access
Čapkun, Srdjan, Buttyán, Levente, Hubaux, Jean-Pierre·2003·Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks

Abstract

In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchronization), to secure routing protocols based on last encounters (with only loose clock synchronization), and to control the topology of the network. SECTOR is based primarily on distance-bounding techniques, on one-way hash chains and on Merkle hash trees. We analyze the communication, computation and storage complexity of the proposed mechanisms and we show that, due to their efficiency and simplicity, they are compliant with the limited resources of most mobile devices.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/986858.986862

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 25 references

Cited by

See all 411

Metadata

Authors
Čapkun, S., Buttyán, L., & Hubaux, J.-P.
Venue
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Publisher
ACM
Published
2003-10-31
Pages
21-32
OpenAlex
W2167930752
Cited by
411
References
25
FWCI
7.19
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: SECTOR: secure tracking of node encounters in multi-hop wireless networks. https://app.cochat.ai/papers/10.1145/986858.986862
The paper
Čapkun, S., Buttyán, L., & Hubaux, J.-P. (2003). SECTOR: secure tracking of node encounters in multi-hop wireless networks. Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks. https://doi.org/10.1145/986858.986862

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.