The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Hot or not: Revealing hidden services by their clock skew
Abstract
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden services are accessible both directly and over the anonymous channel. Traffic patterns through one channel have observable effects on the other, thus allowing a service's pseudonymous identity and IP address to be linked. One proposed solution to this vulnerability is for Tor nodes to provide fixed quality of service to each connection, regardless of other traffic, thus reducing capacity but resisting such interference attacks. However, even if each connection does not influence the others, total throughput would still affect the load on the CPU, and thus its heat output. Unfortunately for anonymity, the result of temperature on clock skew can be remotely detected through observing timestamps. This attack works because existing abstract models of anonymity-network nodes do not take into account the inevitable imperfections of the hardware they run on. Furthermore, we suggest the same technique could be exploited as a classical covert channel and can even provide geolocation.
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.
Integrity signals
Registry
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.
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
A note on the confinement problem
Lampson, B. W. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,429
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
Secure Computer Systems: Mathematical Foundations
Bell, D. E., & LaPadula, L. J. (1973) · Defense Technical Information Center (DTIC) · Cited by 1,017
TCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
Internet Control Message Protocol
Postel, J. (1981) · doi:10.17487/rfc0777 · Cited by 866
Network Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
Low-Cost Traffic Analysis of Tor
Murdoch, S. J., & Danezis, G. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.12 · Cited by 517
Self-citationWeb MIXes: A System for Anonymous and Unobservable Internet Access
Berthold, O., Federrath, H., & Köpsell, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_7 · Cited by 395
Overlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
Cited by
How Unique Is Your Web Browser?
Eckersley, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14527-8_1 · Cited by 756
Traveling the silk road: a measurement analysis of a large anonymous online marketplace
Christin, N. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488408 · Cited by 590
Low-resource routing attacks against tor
Bauer, K., McCoy, D., Grunwald, D., Kohno, T., & Sicker, D. (2007) · Proceedings of the 2007 ACM workshop on Privacy in electronic society · doi:10.1145/1314333.1314336 · Cited by 314
A survey on physical unclonable function (PUF)-based security solutions for Internet of Things
Shamsoshoara, A., Korenda, A., Afghah, F., & Zeadally, S. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107593 · Cited by 310
Shining Light in Dark Places: Understanding the Tor Network
McCoy, D., Bauer, K., Grunwald, D., Kohno, T., & Sicker, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70630-4_5 · Cited by 292
Metadata
- Authors
- Murdoch, S. J.
- Venue
- Proceedings of the 13th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2006-10-30
- Pages
- 27-36
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2002080807
- Cited by
- 253
- References
- 21
- FWCI
- 12.73
- 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: Hot or not: Revealing hidden services by their clock skew. https://app.cochat.ai/papers/10.1145/1180405.1180410
- The paper
- Murdoch, S. J. (2006). Hot or not: Revealing hidden services by their clock skew. Proceedings of the 13th ACM conference on Computer and communications security. https://doi.org/10.1145/1180405.1180410
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.