Pith. sign in

REVIEW 3 major objections 5 minor 61 references

Cache to the Future: A Distributed Webpage Archive for Internet Blackouts

T0 review · 3 major / 5 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A Bluetooth-based distributed archive can keep the web's most useful pages reachable through a two-month internet blackout.

desk verdict A genuinely new design point for blackout-resistant web access, but the headline numbers rest on an unvalidated coupling between community ratings and the usefulness metric. read the letter →

arxiv 2606.17245 v2 pith:N5ZXN4VN submitted 2026-06-15 cs.CR cs.NI

Ross Evans , Diogo Barradas This is my paper · ORCID
classification cs.CRcs.NI
keywords internetblackoutsblackout-resistanttechnologiesmobilemeshnetworksdistributedcachingcontentavailabilityBluetoothcommunicationproof-of-workcensorshipresistance
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that no existing blackout-resistant technology can give citizens continued access to web-based knowledge, and presents Cache to the Future (CttF) as the first system designed to fill that gap. CttF caches static webpages on user phones before a blackout, spreads community ratings over Bluetooth to decide which pages to replicate, and lets users fetch pages directly from nearby peers during the blackout. The claim is that crowdsourced ratings plus cryptographic safeguards (digital signatures for provenance, proof-of-work to curb Sybil rating attacks) make this work at city scale. If correct, residents in blackout-prone regions could keep reading Wikipedia, medical pages, and community resources offline, with the most useful content arriving within hours. The simulations suggest roughly 75% of requests for the 100,000 most useful pages are satisfied over a two-month outage, with only a 5% satisfaction drop even when a quarter of nodes are adversarial.

What carries the argument

The load-bearing mechanism is the combination of locally averaged community ratings and rating-driven Zipf sampling: each user maintains per-page average ratings learned only from direct Bluetooth exchanges, and background caching samples pages with probability proportional to a transformed Zipf distribution, so popularity begets replication. Proof-of-work (SHA-256 prefix) gates rating exchanges to slow Sybil inflation, digital signatures from a trusted proxy provide verifiable page provenance, and a four-page-per-session forwarding limit models realistic Bluetooth throughput. The simulator's contact model—two users in the same 500m grid cell connect with configured probability for a one-min

What would settle it

Collect Bluetooth encounter traces from a few thousand city residents over several weeks (e.g., via a research app logging BLE beacons) and count how often two phones in the same 500m cell establish a session and how many megabytes they exchange per session. If the observed same-cell contact probability is near 5% rather than 100%, or if median sessions move less than one 2.5MB page, the simulation's headline satisfaction and latency numbers would not hold in the field.

Watch

Extended reading notes

Core claim

CttF is a distributed webpage archive that operates in two phases. Pre-blackout, users cache pages fetched through a trusted proxy that signs them, rate pages on a 1–10 scale, and exchange those ratings (and cached URLs) over Bluetooth; a locally maintained community rating per page is updated with each exchange, and a proof-of-work limits how often a MAC-spoofing adversary can re-submit ratings. Background caching samples pages proportionally to a Zipf-transformed rating distribution, so highly rated pages are replicated on more devices. During a blackout, users request pages and receive them from co-located peers over Bluetooth, verifying signatures when available; when signatures are abse

Load-bearing premise

The load-bearing premise is that two users in the same 500-meter grid cell will actually connect over Bluetooth for a full minute of page exchange every 30-minute timestep; the paper's own sparse-contact experiment shows that if real encounter rates are closer to 5% than 100%, one-week satisfaction drops from 73% to 52%.

Editorial extensions

If this is right

  • If the central claim holds, communities facing blackouts could pre-load a small app and accumulate a distributed archive within days of normal browsing, without dedicated infrastructure.
  • The top 10,000 most useful pages would typically arrive in under a day even under jamming of up to 250 km², meaning reference and emergency information stays fresh.
  • Sybil attacks are blunted: even at 25% adversarial nodes, request satisfaction falls only about 5% and latency rises modestly, suggesting rating manipulation cannot easily starve the system.
  • Epidemic routing is not required; direct user-to-user exchanges over sparse Bluetooth encounters suffice, which lowers bandwidth and battery overhead relative to messaging-first mesh apps.
  • The design extends blackout-resistant technology from texting to knowledge access, complementing existing tools that only carry short messages.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: The headline numbers depend on the assumption that two phones in the same 500m cell reliably connect for a minute every 30 minutes; the paper's own 5%-contact experiment cuts one-week satisfaction from 73% to 52%, so real-world Bluetooth encounter rates are the first thing to measure before trusting city-scale claims.
  • Editorial inference: Because satisfaction collapses from 100% to 13.5% for pages beyond the top 100,000, the system is strong for common knowledge but weak for exactly the obscure pages that censorship victims may need; a deployment focused on high-value local content would require seeding rather than relying on ratings alone.
  • Editorial inference: The paper's assumption that seeders rate pages by genuine usefulness may be optimistic; when as few as 5% of nodes are coordinated Sybils, over half of leechers cache useless pages, so the proof-of-work mitigation matters mainly for stalking adversaries, not for distributed rating pollution.
  • Editorial inference: A testable extension is to run a small field pilot where volunteers carry CttF-like devices through a city for a week and log actual session lengths and pages exchanged; those data would either confirm the contact model or force a re-parameterization of the simulations.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. Cache to the Future (CttF) proposes a system for providing access to cached webpages during internet blackouts. In a pre-blackout phase, users cache and rate pages; ratings are exchanged over Bluetooth and used to prioritize background replication. A trusted proxy signs page contents, and proofs-of-work plus local averaging are used to limit Sybil influence. During a blackout, users request pages opportunistically from nearby peers. The paper validates the design through an Android prototype and simulations based on the YJMob100K mobility traces (25,000 users, 75 days, 500m cells). The headline results are roughly 75% request satisfaction over a 60-day blackout for the 100,000 most useful pages, sub-day median latency for the top 10,000 pages, and only a 5% satisfaction drop with 25% Sybils. The authors also compare against epidemic routing and evaluate jamming, cache-manipulation, and proof-of-work costs.

Significance. The work addresses a real and underexplored design point: unlike messaging-focused blackout tools, CttF targets web knowledge access. If the quantitative claims survive scrutiny, the paper would be a useful step toward deployable blackout-resistant content delivery. Strengths include the use of large real mobility traces, direct prototype throughput and battery measurements, and an explicit sensitivity analysis for contact probability. The comparison with epidemic routing is valuable, as is the adversarial evaluation. However, the evaluation's central coupling between the rating signal and the success metric, together with the optimistic baseline contact assumption, mean that the current numbers should be read as upper bounds rather than demonstrated performance.

major comments (3)
  1. [§5.3 and Fig. 3c] The evaluation is circular with respect to the rating signal. The simulator defines a 'ground-truth Zipf-like distribution for page accesses', generates every seeder's ratings as noisy observations of that same ground truth ('Each user's ratings follow the global ground-truth ratings with additive exponentially decaying normal noise'), and then reports satisfaction for 'Page Indices Sorted from Most to Least Useful' — i.e., the same ordering. The paper itself states (§4.3) that no work correlates webpage ratings with popularity and that 'such a correlation may not hold in a blackout.' Thus the simulation only exercises the regime where community ratings are an unbiased, monotone proxy for exactly what the population will request. If real-world ratings are user-specific, topically biased, or decoupled from blackout-time demand, the caching signal weakens and the 75% / top-10k / top-100k n
  2. [§5.2, §6.1, Fig. 4] The baseline contact model is an upper bound. The YJMob100K traces supply positions every 30 minutes in 500m cells; two users in the same cell are assumed to connect with 100% probability per timestep and exchange up to four 2.5MB pages in a one-minute session. Bluetooth range is typically tens of meters, so co-location in a 500m cell does not imply encounter. The traces do not contain Bluetooth encounter observations, so the 100% value is not derived from data. The paper's own sensitivity analysis shows one-week satisfaction drops from 73% to 52% at 5% contact, with larger latency penalties for mid/low utility pages (Fig. 4b/c). The 60-day 75% headline therefore depends on an unvalidated optimistic parameter. Please justify the 100% baseline with empirical encounter-rate data (e.g., from Bluetooth/BLE encounter studies) or present the sensitivity sweep as the primary result.
  3. [§6.4 and Table 2] The comparison against epidemic routing does not equalize resources. CttF nodes store 1200 pages (~3GB) and use pre-blackout community ratings to populate leecher caches; the epidemic-routing baseline stores only 300 forwarding pages (~750MB) and no leecher-side cache. In addition, the adversary is described as making up to 512 spam requests per interaction, which is hard to reconcile with the 4-page forwarding limit used elsewhere. Please equalize the storage and request budgets (or explicitly justify the 4x difference) and specify the per-interaction message budget for spam. Otherwise the claimed advantage over epidemic routing may be an artifact of the resource allocation.
minor comments (5)
  1. [§4.3] The statement 'page access trends follow a Zipf-like distribution [34]' cites a paper on Tor flow correlation attacks; this appears to be the wrong reference. Please verify and correct.
  2. [Fig. 8] The x-axis ranges in Fig. 8a/b are difficult to parse ('-400, -200, 0, +1e6'). Please provide a clear axis for page indices with consistent scaling.
  3. [Table 1] The legend defines '✓: Only somewhat supported' but uses the same symbol as the full checkmark in the column headings. Make the partial marker visually distinct (e.g., half-filled) to avoid ambiguity.
  4. [§6.1] The relationship between the two-month simulation (Fig. 3, 82% by end) and the one-week follow-up simulations (Fig. 4, 73%) should be explained earlier. As written, the reader may see an inconsistency between the headline 75% and the 73% figure.
  5. [Abstract] The abstract's 'no technology currently exists' is stronger than the related-work section supports (Ceno, Kiwix, Collateral Freedom). Suggest softening to 'no widely deployed system' or similar.

Circularity Check

1 steps flagged · score 6.0 of 10

Headline delivery numbers partly reduce to the paper's own assumption that community ratings are a noisy copy of the exact Zipf-derived usefulness metric used to score satisfaction.

  1. self definitional [§4.3 (Caching Prioritization From Ratings), §5.3 (Page rating assumptions / Page requests), §5.1 (Page request satisfaction), Figs. 3c/4c/5c]
    "Although no work (to our knowledge) correlates webpage ratings with popularity (and such a correlation may not hold in a blackout), page access trends follow a Zipf-like distribution [34]. ... We assume that ratings correlate with a transformed Zipf-like distribution: f(x) = 10(a·Zipf(x)^b + c). [...] We assume a ground-truth Zipf-like distribution for page accesses which is transformed into a similarly shaped curve for user ratings. Each user’s ratings follow the global ground-truth ratings with additive exponentially decaying normal noise."

    The signal that drives CttF's caching (seeder ratings) is generated as the global ground-truth rating plus noise, and the success metric is reported for 'Page Indices Sorted from Most to Least Useful' — i.e., the same transformed-Zipf ground truth (fitted to Ruth et al.'s hit shares) from which the ratings were drawn. The paper itself flags that 'no work ... correlates webpage ratings with popularity (and such a correlation may not hold in a blackout)'. Therefore the headline 75% satisfaction / top-10k latency results show only that the system retrieves pages when its input is a noisy copy of the evaluation ground truth; they do not empirically support the load-bearing rating-usefulness link. This makes the central demonstration partly true by construction.

full rationale

The mobility substrate (YJMob100K), the Bluetooth throughput microbenchmarks, the PoW benchmarks, and the epidemic-routing comparison are independent and non-circular; the same applies to the few self-citations in the paper, which are methodological and not load-bearing. The central circularity is the coupling between the rating input and the satisfaction ground truth. §5.3 defines ground-truth page access as a transformed Zipf distribution and draws every seeder's ratings from that same ground truth with 0.5 noise; Figs. 3c/4c/5c then score satisfaction for pages ordered 'from most to least useful', i.e., by that same distribution. The paper concedes in §4.3 that no work correlates ratings with popularity and that the correlation 'may not hold in a blackout,' so the simulation's realism claim rests on an unvalidated assumption that is also the evaluation's success criterion. This is partial circularity, not a fully forced derivation: encounter dynamics, storage constraints, PoW, and jamming still contribute real, independent evidence about the delivery mechanism. Score 6 rather than higher because the core routing/caching operation has independent content, and 6 rather than lower because the headline value proposition (crowdsourced ratings identifying blackout-useful content) is assumed rather than demonstrated.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

No new physical entities are introduced; the load-bearing elements are fitted parameters and domain assumptions. The most consequential are the Zipf rating model (a,b,c), the 100% contact baseline, and the PoW adversary constraints.

free parameters (6)
  • Rating-to-probability transform constants a,b,c = a=2.34, b=0.039, c=-1.36
    Fit in §5.3 to Ruth et al. headline browsing fractions (top 10/100/10000 pages get 25/40/70% of hits). Central caching prioritization uses f^{-1} of this transform; if ratings correlate differently during a blackout, replication ordering changes.
  • Baseline contact probability = 100% (varied down to 5%)
    In §5.3, users in the same 500m grid cell are assumed to interact with 100% probability at baseline; at 5% contact, week-1 satisfaction drops from 73% to 52% (Fig. 4). Real Bluetooth encounter rates are not measured.
  • Seeder rating noise = 0.5 additive exponentially-decaying normal noise
    Chosen by hand in Table 2 to 'account for differences in ratings'; no empirical calibration is provided.
  • Request probability = 0.25 per 30-min timestep
    One request per 2 hours per user; chosen assumption in §5.3 without supporting measurement.
  • Forwarding limit per session = 4 pages
    Derived from 129 KB/s measured throughput and 1-minute sessions; reasonable, but session length is assumed.
  • Proof-of-work difficulty = 17-18 bits (~17-74s on tested phones)
    Chosen from microbenchmarks so low-end phones are not excluded; adversary hardware assumptions constrain its strength.
assumptions (4)
  • domain assumption Page ratings correlate with a transformed Zipf-like access distribution, f(x)=10(a·Zipf(x)^b+c), and this correlation holds during a blackout.
    Stated in §4.3 and §5.3; no blackout rating data exists. The simulator draws ground-truth usefulness from the same model.
  • domain assumption Users in the same 500m x 500m YJMob100K cell encounter each other over Bluetooth with probability up to 100% per 30-min timestep and exchange up to 4 pages in a 1-minute session.
    Baseline §5.3; supported only by a throughput microbenchmark, not by encounter measurements.
  • domain assumption A trusted proxy outside the censored region is reachable pre-blackout via existing circumvention systems, and its signing key is distributed with the app.
    Assumed in §4.1; proxy discovery is declared out of scope.
  • domain assumption State adversary cannot monitor all short-range exchanges, cannot use server-grade hardware for Sybil PoWs (or offload via cellular), and will not make mass arrests of CttF users.
    Threat model §3 and PoW evaluation §6.3; if an adversary can trivially compute PoWs, rating manipulation is cheaper and stalking resistance weakens.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Cache to the Future: A Distributed Webpage Archive for Internet Blackouts." pith.science (2026). https://pith.science/paper/N5ZXN4VN

@misc{pith2026260617245,
  author       = {Pith},
  title        = {Pith review of: Cache to the Future: A Distributed Webpage Archive for Internet Blackouts},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N5ZXN4VN}},
  note         = {Machine review of arXiv:2606.17245}
}
read the original abstract

Internet blackouts, occurring due to technological mishaps or intentional governmental action, prevent citizens from accessing the internet. Citizens in regions where internet blackouts are common have utilized blackout-resistant technologies to maintain communication. Such technologies often rely on mobile mesh networks to provide limited messaging services. However, no technology currently exists which can provide continued access to knowledge sources on the web during a blackout. We present Cache to the Future (CttF): a system to cache and deliver static content hosted on the web during a blackout. CttF's distributed community ratings crowdsources caching at scale while cryptographic constructs (digital signatures, proofs-of-work) mitigate adversarial interference. Our realistic simulations demonstrate CttF delivering content at city-scale across a wide range of benign and adversarial scenarios.

Figures

Figures reproduced from arXiv: 2606.17245 by the authors.

Figure 1
Figure 1. CttF’s workflow. Users cache, rate, and exchange page ratings pre-blackout, requesting cached pages during blackout. 3 Threat Model We assume a state-level adversary who can interrupt internet service within a city, inducing a blackout. Pre-blackout, the adversary may employ filtering [28] or blocking [20]. We assume other means of internet access, such as satellite broadband, are either non-operational [46] or forb… view at source ↗
Figure 2
Figure 2. YJMob100K area with cyan cells jammed, prioritizing points of interest. Users’ distribution. Our simulation supports three user types. Leechers install CttF pre-blackout but do not manually cache or rate pages, simply accumulat￾ing ratings from others and caching automatically. Seeders actively cache and rate pages based on perceived usefulness. Adversaries disrupt the system via rating manipulation, DoS, and jammin… view at source ↗
Figure 3
Figure 3. CttF performance in a benign scenario. ratings once per interaction. We also evaluate the efficacy of proofs-of-work in a “stalking scenario” where each adversary tracks one leecher within their grid cell and repeatedly reinitiates rating exchange; we parameterize the proof-of-work at 1 minute, 30 seconds, and 1 second per exchange across different proportions of adversaries. Finally, adversaries may signal jam grid… view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Impact of contact probability (benign scenario). 0 1 2 3 4 5 6 7 8 Blackout Day 0% 20% 40% 60% 80% 100% Request Satisfaction 0% adversaries 1% adversaries 2% adversaries 5% adversaries 10% adversaries 25% adversaries (a) Request satisfaction 1-100 101-10,000 10,000+ Pa…
Figure 5
Figure 5. Figure 5: Sybil impact. Text above box plots shows median latency for satisfied requests. request and receive pages, followed by one week with no additional page requests to observe the effect of user mobility on satisfaction. Shorter simulations allowed testing a wider range of…
Figure 6
Figure 6. Figure 6: Impact of jammed cells (adversarial scenario). 0 km2 2.5 km2 25 km2 250 km2 2500 km2 Jammed Area 25% 10% 5% 2% 1% Percentage of Sybil Nodes 0% 67.9% 67.5% 67.1% 65.1% 53.8% 69.7% 69.5% 68.8% 67.3% 55.6% 70.8% 71.0% 70.4% 68.4% 57.0% 72.2% 72.0% 71.4% 69.6% 58.4% 72.5% …
Figure 7
Figure 7. Figure 7: CttF metrics with jamming and Sybils. nodes and 250 km2 jammed, CttF can satisfy 67% of all requests, with requests for the top-10 000 pages having a 90% chance of being satisfied in under two days. 6.3 Caching with Adversarial Influence Adversaries cannot prevent cach…
Figure 8
Figure 8. Figure 8: CttF caching with regular and stalking Sybils. and the number of spam requests each Sybil node makes per interaction. With no Sybils, epidemic routing achieves similar request satisfaction but far worse latency: 90th percentile latency is 1.1 days for CttF compared to …

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 2 linked inside Pith

  1. [1]

    Journal of Network and Computer Applications (2018)

    Aceto, G., Botta, A., Marchetta, P., Persico, V., Pescapé, A.: A comprehensive survey on internet outages. Journal of Network and Computer Applications (2018)

    2018

  2. [2]

    In: IEEE Global Humanitarian Technology Conference (2019)

    Álvarez, F., Almon, L., Radtki, H., Hollick, M.: Bluemergency: Mediating post- disaster communication systems using the internet of things and bluetooth mesh. In: IEEE Global Humanitarian Technology Conference (2019)

    2019

  3. [3]

    In: IEEE symposium on security and privacy (2018)

    Angel, S., Chen, H., Laine, K., Setty, S.: Pir with compressed queries and amortized query processing. In: IEEE symposium on security and privacy (2018)

    2018

  4. [4]

    https://archivebox.io/ (2025)

    ArchiveBox: Self-hosted Web Archive Tool. https://archivebox.io/ (2025)

    2025

  5. [5]

    https://datatracker.ietf.org/doc/html/draft-haj jeh-tls-sign-04 (2007)

    Badra, M., Hajjeh, I.: TLS Sign. https://datatracker.ietf.org/doc/html/draft-haj jeh-tls-sign-04 (2007)

    2007

  6. [6]

    Computer Networks90(2015)

    Baig, R., Roca, R., Freitag, F., Navarro, L.: guifi.net, a crowdsourced network infrastructure held in common. Computer Networks90(2015)

    2015

  7. [7]

    In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2023)

    Bienstock, A., Rösler, P., Tang, Y.: ASMesh: Anonymous and secure messaging in mesh networks using stronger, anonymous double ratchet. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2023)

    2023

  8. [8]

    In: Proceedings of the ACM SIG- COMM 2023 Conference (2023)

    Bischof, Z.S., Pitcher, K., Carisimo, E., Meng, A., Bezerra Nunes, R., Padman- abhan, R., Roberts, M.E., Snoeren, A.C., Dainotti, A.: Destination unreachable: Characterizing internet outages and shutdowns. In: Proceedings of the ACM SIG- COMM 2023 Conference (2023)

    2023

Show all 61 references
  1. [9]

    https: //www.uncensoredlibrary.com/en (2023)

    Borders, R.W.: The uncensored library – the digital home of press freedom. https: //www.uncensoredlibrary.com/en (2023)

    2023

  2. [10]

    Briar: https://briarproject.org (2025)

    2025

  3. [11]

    Bridgefy: https://bridgefy.me/ (2025)

    2025

  4. [12]

    https://ww w.cbc.ca/news/science/facebook-solar-drone-internet-1.3690145 (July 2016)

    CBC News: Facebook’s giant internet-beaming solar drone takes off. https://ww w.cbc.ca/news/science/facebook-solar-drone-internet-1.3690145 (July 2016)

    2016

  5. [13]

    Information Economics and Policy 22(4), 299–305 (2010)

    Cox, J., Collins, A., Drinkwater, S.: Seeders, leechers and social norms: Evidence from the market for illicit digital downloading. Information Economics and Policy 22(4), 299–305 (2010)

    2010

  6. [14]

    Crichton, K., Christin, N., Cranor, L.F.: How do home computer users browse the web? ACM Transactions on the Web16(1), 1–27 (2021)

    2021

  7. [15]

    https://github.com/ceno-app/ceno-docs (2026)

    eQualitie: Ceno app docs. https://github.com/ceno-app/ceno-docs (2026)

    2026

  8. [16]

    Proceedings on Privacy Enhancing Technologies (2025)

    Ernstberger, J., Lauinger, J., Wu, Y., Gervais, A., Steinhorst, S.: Origo: Proving provenance of sensitive data with constant communication. Proceedings on Privacy Enhancing Technologies (2025)

    2025

  9. [17]

    In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security

    Fenske, E., Johnson, A.: Bytes to schlep? use a fep: Hiding protocol metadata with fully encrypted protocols. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. pp. 1982–1996 (2024)

    2024

  10. [18]

    Proceedings on Privacy Enhancing Technolo- gies (2015)

    Fifield, D., Lan, C., Hynes, R., Wegmann, P., Paxson, V.: Blocking-resistant com- munication through domain fronting. Proceedings on Privacy Enhancing Technolo- gies (2015)

    2015

  11. [19]

    Pro- ceedings of the ACM on human-computer interaction4, 1–24 (2020)

    Grandhi, S.A., Plotnick, L., Hiltz, S.R.: An internet-less world? expected impacts of a complete internet outage with implications for preparedness and design. Pro- ceedings of the ACM on human-computer interaction4, 1–24 (2020)

    2020

  12. [20]

    In: 30th USENIX Security Symposium (2021)

    Hoang, N.P., Niaki, A.A., Dalek, J., Knockel, J., Lin, P., Marczak, B., Crete- Nishihata, M., Gill, P., Polychronakis, M.: How great is the great firewall? mea- suring china’s DNS censorship. In: 30th USENIX Security Symposium (2021)

    2021

  13. [21]

    Evans and D

    HTTP Archive: Page weight report (Apr 2025), https://httparchive.org/reports/ page-weight 18 R. Evans and D. Barradas

    2025

  14. [22]

    In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2025)

    Inyangson, D., Radway, S., Jois, T.M., Fazio, N., Mickens, J.: Amigo: Secure group mesh messaging in realistic protest settings. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2025)

    2025

  15. [23]

    https: //www.iranintl.com/en/202508039520 (2025)

    Iran International: Iran sees surge in starlink access despite official ban. https: //www.iranintl.com/en/202508039520 (2025)

    2025

  16. [24]

    In: IEEE Symposium on Security and Privacy (2025)

    Kamali, S., Barradas, D.: Anix: Anonymous blackout-resistant microblogging with message endorsing. In: IEEE Symposium on Security and Privacy (2025)

    2025

  17. [25]

    https://kiwix.org (2025)

    Kiwix: Offline Wikipedia and Web Content. https://kiwix.org (2025)

    2025

  18. [26]

    In: 2003 IEEE 58th Vehicular Technology Conference (Oct 2003)

    Klemm,A.,Lindemann,C.,Waldhorst,O.:Aspecial-purposepeer-to-peerfileshar- ing system for mobile ad hoc networks. In: 2003 IEEE 58th Vehicular Technology Conference (Oct 2003)

    2003

  19. [27]

    https://www.knapsackforhope.org/ (2025)

    Knapsack for Hope: Knapsack. https://www.knapsackforhope.org/ (2025)

    2025

  20. [28]

    In: Proceedings of the 5th USENIX Workshop on Free and Open Communications on the Internet (2015)

    Knockel, J., Crete-Nishihata, M., Ng, J.Q., Senft, A., Crandall, J.R.: Every rose has its thorn: Censorship and surveillance on social video platforms in China. In: Proceedings of the 5th USENIX Workshop on Free and Open Communications on the Internet (2015)

    2015

  21. [29]

    Kon, P.T.J., Kamali, S., Pei, J., Barradas, D., Chen, A., Sherr, M., Yung, M.: SpotProxy:Rediscoveringthecloudforcensorshipcircumvention.In:33rdUSENIX Security Symposium (2024)

    2024

  22. [30]

    arXiv preprint arXiv:1612.03371 (2016)

    Lerner, A., Fanti, G., Ben-David, Y., Garcia, J., Schmitt, P., Raghavan, B.: Rangzen: Anonymously getting the word out in a blackout. arXiv preprint arXiv:1612.03371 (2016)

    2016 arXiv

  23. [31]

    https://www.dw.com/en/afghan istan-how-can-messaging-work-safely-in-an-internet-shutdown/a-59018976 (Aug 2021)

    Linow, O.: Safe messaging, without the internet. https://www.dw.com/en/afghan istan-how-can-messaging-work-safely-in-an-internet-shutdown/a-59018976 (Aug 2021)

    2021

  24. [32]

    In: 2011 31st International Conference on Distributed Computing Systems Workshops (Jun 2011)

    Liu, C., Wu, J., Guan, X., Chen, L.: Cooperative File Sharing in Hybrid Delay Tol- erant Networks. In: 2011 31st International Conference on Distributed Computing Systems Workshops (Jun 2011)

    2011

  25. [33]

    In: Proceedings of the 16th ACM interna- tional symposium on mobile ad hoc networking and computing (2015)

    Liu, Y., Bild, D.R., Adrian, D., Singh, G., Dick, R.P., Wallach, D.S., Mao, Z.M.: Performance and energy consumption analysis of a delay-tolerant network for censorship-resistant communication. In: Proceedings of the 16th ACM interna- tional symposium on mobile ad hoc networki...

    2015

  26. [34]

    In: Proceedings of the Network and Dis- tributed System Security Symposium (2024)

    Lopes, D., Dong, J.D., Medeiros, P., Castro, D., Barradas, D., Portela, B., Vina- gre, J., Ferreira, B., Christin, N., Santos, N.: Flow correlation attacks on tor onion service sessions with sliding subset sum. In: Proceedings of the Network and Dis- tributed System Security S...

    2024

  27. [35]

    In: IEEE Symposium on Security and Privacy (2021)

    Ludant, N., Vo-Huu, T.D., Narain, S., Noubir, G.: Linking bluetooth le & clas- sic and implications for privacy-preserving bluetooth-based protocols. In: IEEE Symposium on Security and Privacy (2021)

    2021

  28. [36]

    In: Companion of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing

    Lupien, N., Grandhi, S.A., Plotnick, L., Hiltz, S.R.: Wait, did you say no internet? an exploratory study of the perceived impact of internet outage. In: Companion of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing. pp. 231–234 (2017)

    2017

  29. [37]

    In: IEEE symposium on security and privacy (2022)

    Menon, S.J., Wu, D.J.: Spiral: Fast, high-rate single-server PIR via FHE composi- tion. In: IEEE symposium on security and privacy (2022)

    2022

  30. [38]

    In: IPTPS

    Meulpolder, M., D’Acunto, L., Capota, M., Wojciechowski, M., Pouwelse, J.A., Epema, D.H., Sips, H.J.: Public and private bittorrent communities: a measure- ment study. In: IPTPS. vol. 4, p. 5 (2010)

    2010

  31. [39]

    NewNode: https://www.newnode.com/ (2025)

    2025

  32. [40]

    https://othernet.is/ (2025) Cache to the Future: A Distributed Webpage Archive for Internet Blackouts 19

    Othernet: Satellite Data Broadcast for Everyone. https://othernet.is/ (2025) Cache to the Future: A Distributed Webpage Archive for Internet Blackouts 19

    2025

  33. [41]

    International Journal of Communication Systems25(10), 1281– 1299 (2012)

    Palazzi, C.E., Bujari, A.: Social-aware delay tolerant networking for mobile-to- mobile file sharing. International Journal of Communication Systems25(10), 1281– 1299 (2012)

    2012

  34. [42]

    Paul, P.S., Ghosh, B.C., Ghosh, A., Saha, S., Nandi, S., Chakraborty, S.: Disaster strikes! internet blackout! what’s the fate of crisis mapping? In: 22nd International Conference on Human-Computer Interaction with Mobile Devices and Services (2020)

    2020

  35. [43]

    arXiv preprint arXiv:2207.04145 (2022)

    Perry, N., Spang, B., Eskandarian, S., Boneh, D.: Strong anonymity for mesh mes- saging. arXiv preprint arXiv:2207.04145 (2022)

    2022 arXiv

  36. [44]

    https://www.reuters.com/article/idUSKBN2A22H0/ (Feb 2021)

    Potkin, F., Pang, J.: Offline message app downloaded over million times after myanmar coup. https://www.reuters.com/article/idUSKBN2A22H0/ (Feb 2021)

    2021

  37. [45]

    Proceed- ings on Privacy Enhancing Technologies (3), 247–267 (2022)

    Pradeep, A., Javaid, H., Williams, R., Rault, A., Choffnes, D., Le Blond, S., Ford, B.A.: Moby: A blackout-resistant anonymity network for mobile devices. Proceed- ings on Privacy Enhancing Technologies (3), 247–267 (2022)

    2022

  38. [46]

    https://www.semafor.co m/article/07/18/2024/elon-musks-starlink-battles-africa-regulators (2024)

    Quadri, S.: Elon musk’s starlink battles africa regulators. https://www.semafor.co m/article/07/18/2024/elon-musks-starlink-battles-africa-regulators (2024)

    2024

  39. [47]

    In: 2006 3rd Annual International Conference on Mobile and Ubiquitous Systems - Workshops

    Rajagopalan, S., Shen, C.C.: A Cross-layer Decentralized BitTorrent for Mobile Ad hoc Networks. In: 2006 3rd Annual International Conference on Mobile and Ubiquitous Systems - Workshops. pp. 1–10 (Jul 2006)

    2006

  40. [48]

    In: Proceedings of the Network and Distributed System Security Symposium (2026)

    Ratliff, Z., Yang, R., Bai, A., Berger, H., Sherr, M., Mickens, J.: Mirage: Private, mobility-based routing for censorship evasion. In: Proceedings of the Network and Distributed System Security Symposium (2026)

    2026

  41. [49]

    https://rsf.org/en/collateral-freedom (2024)

    Reporters Without Borders: Collateral Freedom: A Snapshot of Tools Against Cen- sorship. https://rsf.org/en/collateral-freedom (2024)

    2024

  42. [50]

    Cryptology ePrint Archive (2017)

    Ritzdorf, H., Wüst, K., Gervais, A., Felley, G., Capkun, S.: TLS-N: Non- repudiation over TLS enabling-ubiquitous content signing for disintermediation. Cryptology ePrint Archive (2017)

    2017

  43. [51]

    Rosson, Z., Anthonio, F., Carolyn, T., Maguire, M.: Lives on hold: internet shut- downs in 2024 (2025), https://www.accessnow.org/internet-shutdowns-2024/

    2024

  44. [52]

    In: Proceedings of the 22nd ACM Internet Measurement Conference (2022)

    Ruth, K., Fass, A., Azose, J., Pearson, M., Thomas, E., Sadowski, C., Durumeric, Z.: A world wide view of browsing the world wide web. In: Proceedings of the 22nd ACM Internet Measurement Conference (2022)

    2022

  45. [53]

    Shadowsocks: https://shadowsocks.org/ (2025)

    2025

  46. [54]

    Proceedings on Privacy Enhancing Technologies (2023)

    Sharma, P.K., Sharma, R., Singh, K., Maity, M., Chakravarty, S.: Dolphin: A cellular voice based internet shutdown resistance system. Proceedings on Privacy Enhancing Technologies (2023)

    2023

  47. [55]

    https://gitlab.torproject.org/tpo/ anti-censorship/pluggable-transports/lyrebird (2025)

    The Tor Project: Lyrebird - The obfourscator. https://gitlab.torproject.org/tpo/ anti-censorship/pluggable-transports/lyrebird (2025)

    2025

  48. [56]

    https://tb-manual.torproject.org/bridges/ (2025)

    The Tor Project: Tor bridges. https://tb-manual.torproject.org/bridges/ (2025)

    2025

  49. [57]

    In: Proceedings of the ACM SIGCOMM 2022 Conference (2022)

    Uyeda, F., Alvidrez, M., Kline, E., Petrini, B., Barritt, B., Mandle, D., Alexander, A.C.: Sdn in the stratosphere: loon’s aerospace mesh network. In: Proceedings of the ACM SIGCOMM 2022 Conference (2022)

    2022

  50. [58]

    In: 33rd USENIX Security Symposium (2024)

    Xue, D., Ablove, A., Ramesh, R., Danciu, G.K., Ensafi, R.: Bridging barriers: A survey of challenges and priorities in the censorship circumvention landscape. In: 33rd USENIX Security Symposium (2024)

    2024

  51. [59]

    Scientific Data11(1) (2024)

    Yabe, T., Tsubouchi, K., Shimizu, T., Sekimoto, Y., Sezaki, K., Moro, E., Pent- land, A.: YJMob100K: City-scale and longitudinal dataset of anonymized human mobility trajectories. Scientific Data11(1) (2024)

    2024

  52. [60]

    In: Proceedings of the USENIX Security Symposium (2025) 20 R

    Yang, Y., Liu, Q., Brix, C., Zhang, H., Cao, Y.: Certphash: Towards certified perceptual hashing via robust training. In: Proceedings of the USENIX Security Symposium (2025) 20 R. Evans and D. Barradas

    2025

  53. [61]

    Zhang, F., Maram, D., Malvai, H., Goldfeder, S., Juels, A.: DECO: Liberating web data using decentralized oracles for TLS. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (2020) A Simulation Parameters Table 2 contains a list of parameters ...

    2020

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.