CoChat

Improving wireless privacy with an identifier-free link layer protocol

Greenstein, Ben, McCoy, Damon, Pang, Jeffrey, Kohno, Tadayoshi, Seshan, Srinivasan, Wetherall, David · 2008 · Proceedings of the 6th international conference on Mobile systems, applications, and services
Cited by 124

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

Abstract

We present the design and evaluation of an 802.11-like wireless link layer protocol that obfuscates all transmitted bits to increase privacy. This includes explicit identifiers such as MAC addresses, the contents of management messages, and other protocol fields that the existing 802.11 protocol relies on to be sent in the clear. By obscuring these fields, we greatly increase the difficulty of identifying or profiling users from their transmissions in ways that are otherwise straightforward. Our design, called SlyFi, is nearly as efficient as existing schemes such as WPA for discovery, link setup, and data delivery despite its heightened protections; transmission requires only symmetric key encryption and reception requires a table lookup followed by symmetric key decryption. Experiments using our implementation on Atheros 802.11 drivers show that SlyFi can discover and associate with networks faster than 802.11 using WPA-PSK. The overhead SlyFi introduces in packet delivery is only slightly higher than that added by WPA-CCMP encryption (10% vs. 3% decrease in throughput).

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1145/1378600.1378607

Cites

2 of 2 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

  • Tor: The Second-Generation Onion Router

    Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104 · cited 1×

    “We are not concerned with preventing the service from linking together the client’s packets (or vice versa), as techniques used to hide a client’s identity from a service in wired networks (e.g., [ 14 ]) are also applicable in wireless networks.”
    Method
  • Statistical identification of encrypted Web browsing traffic

    Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., & Qiu, L. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004359 · Cited by 377 · cited 1×

    “sizes and timings is sometimes sufficient to identify the keys a user types [28], the web pages he views [30], the videos he watches [26], the languages he speaks [33], and the applications he runs [34].”
    Background

Cited by

See all 124

Metadata

Authors
Greenstein, B., McCoy, D., Pang, J., Kohno, T., Seshan, S., & Wetherall, D.
Venue
Proceedings of the 6th international conference on Mobile systems, applications, and services
Publisher
ACM
Published
2008-06-17
Pages
40-53
OpenAlex
W2145498707
Cited by
124
References
2
FWCI
10.31
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

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.