Completeness theorems for non-cryptographic fault-tolerant distributed computation
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| How to share a secret | 1979 | 13,642 |
| How to generate and exchange secrets | 1986 | 3,752 |
| Reaching Agreement in the Presence of Faults | 1980 | 2,382 |
| Multiparty unconditionally secure protocols | 1988 | 1,550 |
What cites it, inside the corpus
Links
Topics
| Cryptography and Data Security | Computer Science |
| Distributed systems and fault tolerance | Computer Science |
| Privacy-Preserving Technologies in Data | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports2 author record(s) attached.
- supports13 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 a2172c1bbe00c44b…