FINDING · DEFENSE
Publius encrypts content under a symmetric key K, then splits K into n shares using Shamir secret sharing such that any k shares reconstruct K. Each server stores the encrypted document plus one share, so an adversary must corrupt or destroy n−k+1 servers to censor the document, and increasing n or decreasing k raises the bar proportionally.
From 2000-waldman-publius — Publius: A robust, tamper-evident, censorship-resistant web publishing system · §3.2, §5.1 · 2000 · USENIX Security Symposium
Implications
- Tune the n/k ratio deliberately: lower k requires more server compromises to censor but also means fewer corrupt servers can redirect a retriever; a practical floor is k≥3 with n distributed across distinct administrative domains.
- Distribute replicas across servers in different legal jurisdictions so that legal takedown or coercion must succeed simultaneously in multiple countries, not just one.
Tags
Extracted by claude-sonnet-4-6 — review before relying.