The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Perfectly secure message transmission
Open accessAbstract
This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Sarwate [18] observed that Shamir’s scheme [ 21 ] for sharing secrets is closely related to Reed-Solomon coding schemes.”
BackgroundHow to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
Verifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771
On sharing secrets and Reed-Solomon codes
McEliece, R. J., & Sarwate, D. V. (1981) · Communications of the ACM · doi:10.1145/358746.358762 · Cited by 625
Limits on the security of coin flips when half the processors are faulty
Cleve, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12168 · Cited by 451
Easy impossibility proofs for distributed consensus problems
Fischer, M. J., Lynch, N. A., & Merritt, M. (1986) · Distributed Computing · doi:10.1007/bf01843568 · Cited by 257
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62225 · Cited by 255
Fault Tolerance in Networks of Bounded Degree
Dwork, C., Peleg, D., Pippenger, N. J., & Upfal, E. (1988) · SIAM Journal on Computing · doi:10.1137/0217061 · Cited by 121
Self-citationMultiparty computation with faulty majority
Beaver, D., & Goldwasser, S. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63520 · Cited by 102
A zero-one law for Boolean privacy
Chor, B., & Kushilevitz, E. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73013 · Cited by 83
Fault tolerance in networks of bounded degree
Dwork, C., Peleg, D., Pippenger, N. J., & Upfal, E. (1986) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/12130.12169 · Cited by 60
Self-citation
Cited by
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Sundaram, S., & Hadjicostis, C. N. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2088690 · Cited by 472
How to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
Self-citationEstablishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S., & Jajodia, S. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249782 · Cited by 344
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Cramer, R., Dodis, Y., Fehr, S., Padró, C., & Wichs, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_27 · Cited by 259
Byzantine modification detection in multicast networks using randomized network coding
Ho, T., Leong, B., Koetter, R., Medard, M., Effros, M., & Karger, D. R. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365180 · Cited by 253
Metadata
- Authors
- Dolev, D., Dwork, C., Waarts, O., & Yung, M.
- Venue
- Journal of the ACM
- Published
- 1993-01-02
- Volume
- 40
- Issue
- 1
- Pages
- 17-47
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2092148937
- Cited by
- 412
- References
- 16
- FWCI
- 1.98
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.