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

The DOI matches its Crossref record.

Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping

Strasser, Mario, Popper, Christina, Capkun, Srdjan, Cagalj, Mario·2008·2008 IEEE Symposium on Security and Privacy (sp 2008)

Abstract

We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication jammer? An inherent challenge in solving this problem is that known anti-jamming techniques (e.g.,frequency hopping or direct-sequence spread spectrum) which should support device communication during the key establishment require that the devices share a secret spreading key (or code) prior to the start of their communication. This requirement creates a circular dependency between anti-jamming spread-spectrum communication and key establishment, which has so far not been addressed. In this work, we propose an Uncoordinated Frequency Hopping (UFH) scheme that breaks this dependencyand enables key establishment in the presence of a communication jammer. We perform a detailed analysis of our UFH scheme and show its feasibility, both in terms of execution time and resource requirements.

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.1109/sp.2008.9

Cites

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

Cited by

See all 307

Metadata

Authors
Strasser, M., Popper, C., Capkun, S., & Cagalj, M.
Venue
2008 IEEE Symposium on Security and Privacy (sp 2008)
Publisher
IEEE
Published
2008-05
Pages
64-78
ISSN
1081-6011 (ISSN-L)
OpenAlex
W2124952412
Cited by
307
References
0
FWCI
33.26
Type
conference paper
Language
en
Open access
closed

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: Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping. https://app.cochat.ai/papers/10.1109/sp.2008.9
The paper
Strasser, M., Popper, C., Capkun, S., & Cagalj, M. (2008). Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping. 2008 IEEE Symposium on Security and Privacy (sp 2008). https://doi.org/10.1109/sp.2008.9

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.