The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
How to withstand mobile virus attacks (extended abstract)
Open accessAbstract
We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm.We show how local computations (at each processor) and global computations can be polynomial factor-redundancy in the
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
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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Self-stabilizing systems in spite of distributed control
Dijkstra, E. W. (1974) · Communications of the ACM · doi:10.1145/361179.361202 · Cited by 2,097
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
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
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
Directed-graph epidemiological models of computer viruses
Kephart, J. O., & White, S. R. (2002) · Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130801 · Cited by 769
Cohen, F. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90122-2 · Cited by 754
The round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
Perfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 412
Self-citationDenning, D. E. (1986) · 1986 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1986.10010 · Cited by 337
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
With microscope and tweezers: an analysis of the Internet virus of November 1988
Eichin, M. W., & Rochlis, J. A. (2003) · Proceedings. 1989 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1989.36307 · Cited by 197
Multiparty 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
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
Galil, Z., Haber, S., & Yung, M. M. (1987) · International Cryptology Conference · Cited by 89
Self-citationCollective Coin Tossing Without Assumptions nor Broadcasting
Micali, S. M., & Rabin, T. (1991) · Lecture notes in computer science · doi:10.1007/3-540-38424-3_18 · Cited by 16
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Private Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
Metadata
- Authors
- Ostrovsky, R., & Yung, M.
- Venue
- Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91
- Publisher
- ACM Press
- Published
- 1991
- Pages
- 51-59
- OpenAlex
- W1967263393
- Cited by
- 465
- References
- 18
- FWCI
- 1.78
- Type
- conference paper
- 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.