| Information | |
|---|---|
| has gloss | eng: In cryptography, secure multi-party computation is a problem that was initially suggested by Andrew C. Yao in a 1982 paper. In that publication, the millionaire problem was introduced: Alice and Bob are two millionaires who want to find out which is richer without revealing the precise amount of their wealth. Yao proposed a solution allowing Alice and Bob to satisfy their curiosity while respecting the constraints. |
| lexicalization | eng: Virtual Party Protocol |
| instance of | e/Cryptographic protocol |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint