Construct · 1 fields · 1 citations

Cleve's impossibility result: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Cleve'simpossibility result1 CONSTRUCTCleve's impossibilityCLEVE · CRYPTOGRAPHY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Cryptography

the result that without an honest majority no protocol can toss a fair coin, so complete fairness in secure computation is impossible in general.

In cryptography, Cleve's impossibility result refers to the result that without an honest majority no protocol can toss a fair coin, so complete fairness in secure computation is impossible in general. This meaning comes from Cleve (1986) in Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Cleve's impossibility result sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

coin2 fields · 2 citationsjingle · one word, two constructsfairness4 fields · 4 citationsjingle · one word, four constructsprotocol1 fields · 1 citationsanchor · a standalone construct

References

  1. Cleve, R. (1986). Limits on the security of coin flips when half the processors are faulty. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12168

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct