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

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

Adaptively secure multi-party computation

Open access
Canetti, Ran, Feige, Uri, Goldreich, Oded, Naor, Moni·1996·Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96

Abstract

A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries (i.e., adversaries that may choose the corrupted parties during the course of the computation), in a setting where the channels are insecure and secure communication is achieved by cryptographic primitives based on the computational limitations of the adversary.

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

Cites

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

Cited by

See all 548

Metadata

Authors
Canetti, R., Feige, U., Goldreich, O., & Naor, M.
Venue
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
Publisher
ACM Press
Published
1996
Pages
639-648
OpenAlex
W2096430557
Cited by
548
References
2
FWCI
11.33
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: Adaptively secure multi-party computation. https://app.cochat.ai/papers/10.1145/237814.238015
The paper
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996). Adaptively secure multi-party computation. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.238015

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.