標題: An efficient solution to the millionaires' problem based on homomorphic encryption
作者: Lin, HY
Tzeng, WG
資訊工程學系
Department of Computer Science
關鍵字: secure computation;the greater than problem;the socialist millionaires;problem homomorphic encryption
公開日期: 2005
摘要: We proposed a two-round protocol for solving the Millionaires' Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic order as those of the other efficient protocols. Nevertheless, since multiplicative homomorphic encryption scheme is more efficient than an additive one practically, our construction saves computation time and communication bandwidth in practicality.
URI: http://hdl.handle.net/11536/24989
ISBN: 3-540-26223-7
ISSN: 0302-9743
期刊: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS
Volume: 3531
起始頁: 456
結束頁: 466
Appears in Collections:Conferences Paper