Censorship-resistant publishing systems
E1139504
UNEXPLORED
Censorship-resistant publishing systems are distributed, fault-tolerant architectures designed to store and disseminate information in ways that make it extremely difficult for authorities or adversaries to suppress, alter, or remove published content.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Censorship-resistant publishing systems canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T15139338 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Censorship-resistant publishing systems Context triple: [Hector Garcia-Molina, notableWork, Censorship-resistant publishing systems]
-
A.
Information Doesn’t Want to Be Free
"Information Doesn’t Want to Be Free" is a nonfiction book by Cory Doctorow that critiques modern copyright and digital rights regimes while advocating for open culture and user freedoms in the digital age.
-
B.
paper "Chaffing and Winnowing: Confidentiality without Encryption"
"Chaffing and Winnowing: Confidentiality without Encryption" is a paper by Ronald L. Rivest that proposes a method for achieving data confidentiality without using traditional encryption, instead relying on message authentication codes and the separation of valid and invalid data.
-
C.
Decentralized Administration of Attica
The Decentralized Administration of Attica is a regional state authority in Greece responsible for overseeing and coordinating government functions across the Attica area, including municipalities such as Marathon.
-
D.
Practical Byzantine Fault Tolerance
Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
-
E.
Blakley secret sharing scheme
The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Censorship-resistant publishing systems Target entity description: Censorship-resistant publishing systems are distributed, fault-tolerant architectures designed to store and disseminate information in ways that make it extremely difficult for authorities or adversaries to suppress, alter, or remove published content.
-
A.
Information Doesn’t Want to Be Free
"Information Doesn’t Want to Be Free" is a nonfiction book by Cory Doctorow that critiques modern copyright and digital rights regimes while advocating for open culture and user freedoms in the digital age.
-
B.
paper "Chaffing and Winnowing: Confidentiality without Encryption"
"Chaffing and Winnowing: Confidentiality without Encryption" is a paper by Ronald L. Rivest that proposes a method for achieving data confidentiality without using traditional encryption, instead relying on message authentication codes and the separation of valid and invalid data.
-
C.
Decentralized Administration of Attica
The Decentralized Administration of Attica is a regional state authority in Greece responsible for overseeing and coordinating government functions across the Attica area, including municipalities such as Marathon.
-
D.
Practical Byzantine Fault Tolerance
Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
-
E.
Blakley secret sharing scheme
The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.