Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 268

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Communication complexity of secure computation (extended abstract)

Franklin, Matthew, Yung, Moti·1992·Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92

Abstract

A secret-ballot vote for a single proposition is an example of a secure distributed computation. The goal is for m participants to jointly compute the output of some n-ary function (in this case, the sum of the votes), while protecting their individual inputs against some form of misbehavior.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/129712.129780

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 12 references

Cited by

See all 268

Metadata

Authors
Franklin, M., & Yung, M.
Venue
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
Publisher
ACM Press
Published
1992
Pages
699-710
OpenAlex
W2080975816
Cited by
268
References
12
FWCI
2.67
Type
conference paper
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: Communication complexity of secure computation (extended abstract). https://app.cochat.ai/papers/10.1145/129712.129780
The paper
Franklin, M., & Yung, M. (1992). Communication complexity of secure computation (extended abstract). Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. https://doi.org/10.1145/129712.129780

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.