The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
How to play any mental game, or a completeness theorem for protocols with honest majority
Abstract
research-article Share on How to play any mental game, or a completeness theorem for protocols with honest majority Authors: Oded Goldreich Technion TechnionView Profile , Silvio Micali MIT MITView Profile , Avi Wigderson Hebrew University Hebrew UniversityView Profile Authors Info & Claims Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio MicaliOctober 2019 Pages 307–328https://doi.org/10.1145/3335741.3335755Published:04 October 2019Publication History 57citation435DownloadsMetricsTotal Citations57Total Downloads435Last 12 Months42Last 6 weeks11 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Self-citationVerifiable 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
Self-citationProofs 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
Self-citationOne way functions and pseudorandom generators
Levin, L. A. (1987) · Combinatorica · doi:10.1007/bf02579323 · Cited by 257
Cited by
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Katz, J., Ostrovsky, R., & Yung, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_29 · Cited by 398
Privacy preservation in federated learning: An insightful survey from the GDPR perspective
Truong, N., Sun, K., Wang, S., Guitton, F., & Guo, Y. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102402 · Cited by 399
Privacy and Security Issues in Deep Learning: A Survey
Liu, X., Xie, L., Wang, Y., Zou, J., Xiong, J., Ying, Z., & Vasilakos, A. V. (2021) · IEEE Access · doi:10.1109/access.2020.3045078 · Cited by 282
Aumann, R. J., & Hart, S. (2003) · Econometrica · doi:10.1111/1468-0262.00465 · Cited by 282
Metadata
- Authors
- Technion, Goldreich, O., Micali, S., MIT, Wigderson, A., & Hebrew University
- Venue
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Publisher
- Association for Computing Machinery
- Published
- 2019-10-09
- OpenAlex
- W44936433
- Cited by
- 403
- References
- 4
- FWCI
- 47.69
- Type
- book chapter
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: How to play any mental game, or a completeness theorem for protocols with honest majority. https://app.cochat.ai/papers/10.1145/3335741.3335755
- The paper
- Technion, Goldreich, O., Micali, S., MIT, Wigderson, A., & Hebrew University. (2019). How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. https://doi.org/10.1145/3335741.3335755
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.
