Some Practical and Secure Two-party Computation Protocols

Wen-Guey Tzeng*

*Corresponding author for this work

Research output: Contribution to conferencePaper

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 languageEnglish
Pages105-108
Number of pages4
StatePublished - 1 Dec 1998
Event4th International Conference on Computer Science and Informatics, JCIS 1998 - Research Triangle Park, NC, United States
Duration: 23 Oct 199828 Oct 1998

Conference

Conference4th International Conference on Computer Science and Informatics, JCIS 1998
CountryUnited States
CityResearch Triangle Park, NC
Period23/10/9828/10/98

Cite this