Yao's Millionaires' problem
id:
yao-s-millionaires-problem-278-10820577
title:
Yao's Millionaires' problem
text:
Yao's Millionaires' problem is a secure multi-party computation problem introduced in 1982 by computer scientist and computational theorist Andrew Yao. 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 determine whether the inequality a ≥ b is true or false without revealing the actual values o
brand slug:
wiki
category slug:
encyclopedia
description:
Problem in mathematics
original url:
https://en.wikipedia.org/wiki/Yao%27s_Millionaires%27_problem
date created:
date modified:
2024-01-22T03:20:03Z
main entity:
{"identifier":"Q2599574","url":"https://www.wikidata.org/entity/Q2599574"}
image:
fields total:
13
integrity:
14