This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price includes VAT (USA)
Tax calculation will be finalised during checkout.
D. Beaver, Perfect privacy for two-party protocols,Harvard Tec. Report TR-11-89, Aiken Computer Laboratory.
M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault tolerant distributed computations,Proceedings 20th STOC (1988), 1–10.
D. Chaum, C. Crépeau, and I. Damgard, Multiparty unconditionally secure protocols,Proceedings 20th STOC (1988), 11–19.
B. Chor and E. Kushilevitz, A zero-one law for Boolean privacy,Proceedings 21st STOC (1989), 62–72.
A. C. Yao, Protocols for secure computation,Proceedings FOCS (1982), 160–164.
About this article
Cite this article
Gale, D. Mathematical entertainments. The Mathematical Intelligencer 13, 49–52 (1991). https://doi.org/10.1007/BF03028343
- Numerical Exploration
- Perfect Privacy
- Secret Number
- Maximum Salary
- Prove Existence Theorem