Cited by 3,306Cryptography and Data SecurityInternet Traffic Analysis and Secure E-votingCoding theory and cryptography

Protocols for secure computations

Yao, Andrew C.·1982·23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)

Abstract

The author investigates the following problem: Suppose m people wish to compute the value of a function f(x1, x2, x3, ..., xm), which is an integer-valued function of m integer variables xi of bounded range. Assume initially person Pi knows the value of xi and no other x's. Is it possible for them to compute the value of f, by communicating among themselves, without unduly giving away any information about the values of their own variables? The author gives a precise formulation of this general problem and describe three ways of solving it by use of one-way functions (i.e., functions which are easy to evaluate but hard to invert). These results have applications to secret voting, private querying of database, oblivious negotiation, playing mental poker, etc.. He also discusses the complexity question "How many bits need to be exchanged for the computation," and describes methods to prevent participants from cheating. Finally, he studies the question "What cannot be accomplished with one-way functions."

Integrity signals

Registry

Crossref · 10.1109/sfcs.1982.38

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Homomorphic encryption, secure multiparty compute, and trusted execution environments allow collaborative computations to be performed with untrusted parties while maintaining confidentiality of the inputs.

    “Homomorphic encryption58, secure multiparty compute59, and trusted execution environments (TEEs)60,61 allow for collaborative computations to be performed with untrusted parties while maintaining confidentiality of the inputs to the computation.”
  • Blockchain has applications such as asset management, stock markets, and banking.

    “Blockchain has applications such as asset management, stock markets, banking, etc. [133,134].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yao, A. C.
Affiliations
University of California, Berkeley (US)
Corresponding author
Yao, Andrew C.
Venue
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
Publisher
IEEE
Published
1982-11
Pages
160-164
ISSN
0272-5428 (ISSN-L)
OpenAlex
W3141585064
Cited by
3,306
References
1
Citations by year
2026: 144 · 2025: 262 · 2024: 268 · 2023: 252 · 2022: 241 · 2021: 217 · 2020: 188 · 2019: 176 · 2018: 175 · 2017: 162 · 2016: 148 · 2015: 131 · 2014: 110 · 2013: 108 · 2012: 109
FWCI
1.07
Type
conference paper
Language
en
Open access
closed
Locations
Annual Symposium on Foundations of Computer Science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
secure multi-party computation, one-way functions, privacy-preserving computation, secret ballot, communication complexity, cheating prevention, impossibility results

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