Some Practical and Secure Two-party Computation Protocols

Wen-Guey Tzeng*

*此作品的通信作者

研究成果: Paper同行評審

摘要

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.

原文English
頁面105-108
頁數4
出版狀態Published - 1998
事件4th International Conference on Computer Science and Informatics, JCIS 1998 - Research Triangle Park, NC, United States
持續時間: 23 10月 199828 10月 1998

Conference

Conference4th International Conference on Computer Science and Informatics, JCIS 1998
國家/地區United States
城市Research Triangle Park, NC
期間23/10/9828/10/98

指紋

深入研究「Some Practical and Secure Two-party Computation Protocols」主題。共同形成了獨特的指紋。

引用此