Abstract
In the secure two-party computation model, two players would like to compute a function from their secrets, however, without revealing the secrets. In this paper we presents two-party computation protocols for exponentiation, equality, membership and comparison and show that they are secure. The comparison protocol gives a practical message-efficient solution for Yao's millionaire problem.
| Original language | English |
|---|---|
| Pages | 105-108 |
| Number of pages | 4 |
| State | Published - 1 Dec 1998 |
| Event | 4th International Conference on Computer Science and Informatics, JCIS 1998 - Research Triangle Park, NC, United States Duration: 23 Oct 1998 → 28 Oct 1998 |
Conference
| Conference | 4th International Conference on Computer Science and Informatics, JCIS 1998 |
|---|---|
| Country | United States |
| City | Research Triangle Park, NC |
| Period | 23/10/98 → 28/10/98 |