Secure Multi-Party Computation
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

Secure multi-party computation (also known as secure computation or multi-party computation (MPC)) is a sub field of cryptography. The goal of methods for secure multi-party computation is to enable parties to jointly compute a function over their inputs, while at the same time keeping these inputs private. For example, two millionaires can compute which one is richer, but without revealing their net worth. In fact, this very example was initially suggested by Andrew C. Yao in a 1982 paper., and was later named the millionaire problem.

Andere Kunden interessierten sich auch für
Produktbeschreibung
Secure multi-party computation (also known as secure computation or multi-party computation (MPC)) is a sub field of cryptography. The goal of methods for secure multi-party computation is to enable parties to jointly compute a function over their inputs, while at the same time keeping these inputs private. For example, two millionaires can compute which one is richer, but without revealing their net worth. In fact, this very example was initially suggested by Andrew C. Yao in a 1982 paper., and was later named the millionaire problem.