How to generate and exchange secrets

Andrew Chi-Chih Yao

doi:https://doi.org/10.1109/sfcs.1986.25

How to generate and exchange secrets

1986 · 3,752 citations · 4 from inside this corpus

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

6 of 6 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

Universally composable security: a new paradigm for cryptographic protocols→How to generate and exchange secretsLegacy edge — source detail unavailable
Completeness theorems for non-cryptographic fault-tolerant distributed computation→How to generate and exchange secretsLegacy edge — source detail unavailable
Data mining with big data→How to generate and exchange secretsLegacy edge — source detail unavailable
Security and Composition of Multiparty Cryptographic Protocols→How to generate and exchange secretsLegacy edge — source detail unavailable
How to generate and exchange secrets→Protocols for secure computationsLegacy edge — source detail unavailable
How to generate and exchange secrets→Protocols for secure computationsLegacy edge — source detail unavailable
Universally composable security: a new paradigm for cryptographic protocols→Security and Composition of Multiparty Cryptographic ProtocolsLegacy edge — source detail unavailable
Universally composable security: a new paradigm for cryptographic protocols→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
Universally composable security: a new paradigm for cryptographic protocols→Protocols for secure computationsLegacy edge — source detail unavailable
Security and Composition of Multiparty Cryptographic Protocols→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
Security and Composition of Multiparty Cryptographic Protocols→Protocols for secure computationsLegacy edge — source detail unavailable

What this paper cites, inside the corpus

Paper	Year	Cited
Protocols for secure computations	1982	3,069
Protocols for secure computations	1982	2,727

What cites it, inside the corpus

Paper	Year	Cited
Universally composable security: a new paradigm for cryptographic protocols	2001	3,340
Completeness theorems for non-cryptographic fault-tolerant distributed computation	1988	2,542
Data mining with big data	2013	2,416
Security and Composition of Multiparty Cryptographic Protocols	2000	1,424

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
graph theory and CDMA systems	Engineering
Complexity and Algorithms in Graphs	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports1 author record(s) attached.
supports18 reference(s) recorded.
supportsThe DOI's year agrees with the publication year.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:46+00:00.

sha256 bba2969b3567609a…