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-publiusPublius: A robust, tamper-evident, censorship-resistant web publishing system · §3.2, §5.1 · 2000 · USENIX Security Symposium

Implications

Tags

censors
generic
techniques
ip-blocking
defenses
meta-resistance

Extracted by claude-sonnet-4-6 — review before relying.