Crypto Gloss

Protocols for Secure Computations (1982): Yao’s Framework for Secure Computation

Authors Andrew C. Yao
Year 1982
Work Protocols for Secure Computations (extended abstract)
Venue 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 160–164
Field Secure computation; cryptography
Official source IEEE bibliographic record and DOI

Editorial note: This page summarizes the cited research paper. It is not a verbatim reproduction, implementation guide, security audit, or financial recommendation.

Summary

Andrew Yao’s short 1982 paper asks how two people can compute a result from private inputs without automatically revealing those inputs to each other. It presents a general way to think about “secure computation,” then uses the Millionaires’ Problem as a concrete example: two people want to learn whose amount is greater without disclosing the exact amounts.

The useful idea is the protocol’s intended information boundary. If the agreed result is only “Alice’s amount is larger” or “Bob’s is larger,” the protocol should let the parties learn that comparison while limiting what else they can infer, under the paper’s stated model and assumptions. The output itself can still reveal information: learning who is wealthier necessarily reveals the ordering.

What the paper models

Yao describes parties with private values who want to evaluate agreed functions of those values. The protocol must produce the right result while limiting unintended information leakage. This brings privacy and correctness into the design of a computation, rather than treating cryptography only as a way to hide messages sent over a channel.

The paper gives three approaches to the Millionaires’ Problem, but its five-page extended abstract explains one in detail. Its analysis uses computational assumptions based on one-way functions and formalizes what the parties should learn. It also considers the possibility that a participant may deviate from the protocol. These are properties of a mathematical model, not a guarantee that every real system built around the broad idea is secure.

Scope: two parties and later MPC

Yao says the framework can be extended to multiple parties, but the abstract narrows its formal definitions and results mainly to two participants. It also distinguishes the computation-focused case from settings with outside eavesdroppers or saboteurs. It is therefore more accurate to call this an early framework for secure computation than a complete modern specification for every multiparty protocol.

Later papers developed different models and guarantees. Goldreich, Micali, and Wigderson’s 1987 result, for example, concerns protocols with an honest majority. Much later, threshold-signature protocols such as FROST addressed a narrower task: producing a signature when enough key-share holders cooperate. A threshold wallet may use multiparty cryptography, but that task is not the same as the general computation problem Yao studied.

What it does not establish

  • It does not describe a currently deployed crypto wallet, exchange, blockchain, or custody product.
  • It does not claim private inputs remain hidden regardless of what the agreed output reveals.
  • It is not a modern implementation standard, performance benchmark, or independent product audit.
  • It should not be conflated with Yao’s distinct 1986 IEEE paper linked by the old page’s source URL.

The original work is best read as a foundational research contribution with a clearly stated scope. Its value lies in its problem formulation and security reasoning under explicit assumptions; later constructions must be judged by their own protocols, threat models, and evidence.

Social Media Sentiment

A small recent Reddit discussion sample about MPC wallet designs—not about Yao’s 1982 paper—shows interest alongside questions about whether threshold machinery is necessary, how parties could collude, and who controls policy checks. The February 2026 r/crypto discussion of role-gated MPC wallets drew only a handful of votes at review. It is a low-engagement anecdote, not a representative measure of community opinion or adoption.

Last updated: 2026-10

Related Terms

See Also

Sources