Pith. sign in

REVIEW 2 major objections 61 references

Reviewed by Pith at T0; open to challenge.

T0 means a machine referee read the full paper against a public rubric. The mark states how deep the mechanical check went, never who wrote it. the ladder, T0–T4 →

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

T0 review · grok-4.3

Cache to the Future crowdsources static web content caching through community ratings and cryptographic checks to maintain access during internet blackouts.

2026-06-27 03:09 UTC pith:N5ZXN4VN

load-bearing objection CttF is a straightforward application of mesh networks plus community ratings and standard crypto to static web content in blackouts, but the city-scale simulation claims rest on an unexamined model of how ratings hold up under low participation or attacks. the 2 major comments →

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

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

Ross Evans , Diogo Barradas This is my paper
classification cs.CR cs.NI
keywords internet blackoutsdistributed cachingweb archivingcommunity ratingscryptographic verificationadversarial resiliencemesh networks
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper introduces Cache to the Future as a distributed system that archives and delivers static webpages when internet access is lost due to technical failure or government action. It crowdsources decisions on what to cache using community ratings while applying digital signatures and proofs-of-work to limit adversarial disruption. Realistic simulations show the system operating at city scale in both normal and hostile conditions. A reader would care because citizens in blackout-prone regions currently lack any method to reach web knowledge sources beyond limited mesh-network messaging.

Core claim

Cache to the Future caches and delivers static web content during blackouts by crowdsourcing caching decisions through distributed community ratings, with digital signatures and proofs-of-work mitigating adversarial interference. Realistic simulations demonstrate the system delivering content at city scale across a wide range of benign and adversarial scenarios.

What carries the argument

Distributed community ratings that crowdsource caching decisions, protected by digital signatures and proofs-of-work.

Load-bearing premise

Community ratings combined with cryptographic checks can scale to produce accurate caching decisions without being undermined by coordinated adversaries or low participation.

What would settle it

A city-scale simulation in which coordinated adversaries submit large volumes of misleading ratings and honest participation stays low, after which delivered content accuracy falls below usable levels.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Citizens gain continued access to static web knowledge sources when connectivity is severed.
  • The approach operates at city scale under both normal and adversarial conditions.
  • Cryptographic protections reduce the impact of interference on caching choices.
  • The system extends existing mesh-network tools used during blackouts to include webpage delivery.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Integration with existing citizen mesh networks could speed deployment in blackout regions.
  • The design raises questions about how rating incentives would hold up over repeated blackouts.
  • Adaptations might allow partial support for non-static content if update mechanisms are added.
  • Real-world trials in regions with frequent blackouts would test whether simulation assumptions hold.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 0 minor

Summary. The paper introduces Cache to the Future (CttF), a distributed system for caching and delivering static web content during internet blackouts. It relies on community-driven ratings for caching decisions at scale, combined with digital signatures and proofs-of-work to counter adversaries. The central claim is that realistic simulations show CttF successfully delivering content at city scale across benign and adversarial scenarios.

Significance. If the simulation results hold under rigorous validation, the work would address a clear gap in blackout-resistant technologies by extending beyond messaging to web content access, with potential practical value in regions experiencing frequent connectivity disruptions.

major comments (2)
  1. [Abstract] Abstract: The headline claim that 'realistic simulations demonstrate CttF delivering content at city-scale across a wide range of benign and adversarial scenarios' rests entirely on unspecified simulation details; no methodology, parameters (e.g., participation rates, rating accuracy, adversary coordination strength), validation against real data, or error analysis is provided, rendering the support for the central claim unevaluable.
  2. [Abstract] Evaluation approach (implied by the simulation claim): The modeling of how community ratings plus cryptographic checks produce correct caching decisions under low participation or coordinated adversaries is the load-bearing assumption for the adversarial scenarios, yet no concrete encoding of these factors or sensitivity analysis is described.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed feedback. We agree that the abstract requires additional detail to make its claims evaluable and will revise the manuscript to address the concerns about simulation transparency and modeling. Our responses to the major comments follow.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The headline claim that 'realistic simulations demonstrate CttF delivering content at city-scale across a wide range of benign and adversarial scenarios' rests entirely on unspecified simulation details; no methodology, parameters (e.g., participation rates, rating accuracy, adversary coordination strength), validation against real data, or error analysis is provided, rendering the support for the central claim unevaluable.

    Authors: We agree that the abstract is insufficiently detailed to support the central claim on its own. In the revision we will expand the abstract to include key simulation parameters (participation rates of 5-30%, rating accuracy of 70-90%, adversary fractions up to 20%) and add an explicit pointer to the evaluation methodology in Section 4. The simulations use parameters drawn from prior mesh-network and blackout studies rather than direct real-world blackout traces, as no suitable public city-scale datasets exist; we will note this limitation and the resulting error bounds in the revised text. revision: yes

  2. Referee: [Abstract] Evaluation approach (implied by the simulation claim): The modeling of how community ratings plus cryptographic checks produce correct caching decisions under low participation or coordinated adversaries is the load-bearing assumption for the adversarial scenarios, yet no concrete encoding of these factors or sensitivity analysis is described.

    Authors: The encoding of ratings (as a weighted voting process with tolerance for faulty inputs) and cryptographic checks (signature verification plus PoW rate-limiting) is presented in the evaluation section. We will add an explicit sensitivity analysis subsection in the revision that varies participation from 1% to 50% and adversary coordination strength, demonstrating the thresholds at which delivery remains viable. Concrete parameter values and the decision logic will be stated clearly. revision: yes

Circularity Check

0 steps flagged

No circularity; simulation-based validation is independent of system definition

full rationale

The paper describes a system (CttF) using community ratings and cryptography, then claims performance via 'realistic simulations' across scenarios. No equations, derivations, or first-principles results are shown that reduce to self-definition, fitted parameters renamed as predictions, or self-citation chains. The simulation claim is presented as external validation rather than a tautological output of the system's own inputs. No load-bearing self-citations or ansatzes appear in the abstract or described structure. This matches the default expectation of non-circularity for simulation papers.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities beyond the high-level system description; the central claim depends on unstated assumptions about simulation fidelity and cryptographic effectiveness against adversaries.

pith-pipeline@v0.9.1-grok · 5653 in / 1085 out tokens · 31858 ms · 2026-06-27T03:09:00.227341+00:00 · methodology

0 comments
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 Diogo Barradas, Ross Evans.

Figure 1
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 [4… view at source ↗
Figure 2
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, … view at source ↗
Figure 3
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 signa… view at source ↗
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+ Page Indices Sorted from Most to Least Useful 0 2 4 6 8 Days 0h 6.5h 2.2d 0h 7h 2.3d 0h 7.5h 2.4d 0h 9h 2.5d 0h 11h 2.6d 0h 12h 2.8d 0% advers… view at source ↗
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 parameters within our computational constraints. Limited contact remains effective. Figs. 4a, 4b and 4c show satisfaction and latency as in… view at source ↗
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% 72.4% 71.9% 69.8% 58.9% 73.0% 72.8% 72.2% 70.6% 59.3% (a) Req. satisfaction (after a week). 0 km2 2.5 km2 25 km2 250 km2 2500 km2 Jammed Are… view at source ↗
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 caching of popular pages. We simulate ad￾versaries cooperating to manipulate ratings for the top 500 most useful and least useful pages. Suffici… view at source ↗
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 3.2 days for epidemic routing. When Sybils are introduced, they request useless pages to spam the forwarding buffers of non-adversaries. Wit… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

61 extracted references · 3 canonical work pages · 1 internal anchor

  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

  9. [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

  10. [10]

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

    2025

  11. [11]

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

    2025

  12. [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

  13. [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

  14. [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

  15. [15]

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

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

    2026

  16. [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

  17. [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

  18. [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

  19. [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

  20. [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

  21. [21]

    Evans and D

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

    2025

  22. [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

  23. [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)

    work page arXiv 2025

  24. [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

  25. [25]

    https://kiwix.org (2025)

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

    2025

  26. [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

  27. [27]

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

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

    2025

  28. [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

  29. [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

  30. [30]

    Rangzen: Anonymously Getting the Word Out in a Blackout

    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)

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  31. [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

  32. [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

  33. [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 networking and computing (2015)

    2015

  34. [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 Symposium (2024)

    2024

  35. [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

  36. [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

  37. [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

  38. [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

  39. [39]

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

    2025

  40. [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

  41. [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

  42. [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

  43. [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)

    work page arXiv 2022

  44. [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

  45. [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

  46. [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

  47. [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

  48. [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

  49. [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

  50. [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

  51. [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

  52. [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

  53. [53]

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

    2025

  54. [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

  55. [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

  56. [56]

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

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

    2025

  57. [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

  58. [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

  59. [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

  60. [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

  61. [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 for the simulation testbed described in §5.3. T able 2.Simulation parameters. Bo...

    2020