Yao's Millionaires' Problem
Versandkostenfrei!
Versandfertig in 6-10 Tagen
23,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Yao''s Millionaires'' problem is a secure multiparty communication problem which was introduced by Andrew Yao, a prominent computer scientist and computational theorist. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing their actual wealth. This problem is analogous to a more general problem where there are two numbers a and b and the goal is to solve the inequality a geq b without revealing ...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Yao''s Millionaires'' problem is a secure multiparty communication problem which was introduced by Andrew Yao, a prominent computer scientist and computational theorist. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing their actual wealth. This problem is analogous to a more general problem where there are two numbers a and b and the goal is to solve the inequality a geq b without revealing the actual values of a and b. The Millionaires'' Problem is an important problem in cryptography and its solution is used in e-commerce and data mining. Commercial applications sometimes have to compare between numbers which are confidential and whose security is important. Many solutions have been introduced for the problem, among which the first solution, presented by Yao himself, was exponential in time and space. This article presents and explains one possible solution.
Andere Kunden interessierten sich für
