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

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

A minimal model for secure computation (extended abstract)

Open access
Feige, Uri, Killian, Joe, Naor, Moni · 1994 · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94

Abstract

We consider a minimal scenario for secure computation: Parties A and B have private inputs x and y and a shared random string r.A and B are each allowed to send a single message to a third party C, from which C is to learn the value of ~(z, y) for some function ~, but nothing else.We show that this model is surpris-Permission to copywithout fee all or part of this material is granted provided that the copies are not made or distributed for direct eommarcial advantaqe, tha ACM copyrioht notice a?d the title of the publicatiort 'and Its date appear, and notice is gwen that copying is by permission of the Association of Computing Machinery.

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/195058.195408

Cites

1 of 1 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 1 references

Cited by

See all 251

Metadata

Authors
Feige, U., Killian, J., & Naor, M.
Venue
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
Publisher
ACM Press
Published
1994
Pages
554-563
OpenAlex
W2021276494
Cited by
251
References
1
FWCI
2.08
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A minimal model for secure computation (extended abstract). https://app.cochat.ai/papers/10.1145/195058.195408
The paper
Feige, U., Killian, J., & Naor, M. (1994). A minimal model for secure computation (extended abstract). Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. https://doi.org/10.1145/195058.195408

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.