AN EFFICIENT HOMOMORPHIC ENCRYPTION BASED SOLUTION TO MILLIONAIRES’ PROBLEM | Asian Journal of Math

In recent years, secure multi-party computation has become a significant study field in international cryptography. The millionaires' problem is the most fundamental and crucial topic in secure multi-party computation, and it is the subject of this study. The goal is to compare the size of two data sets in a secure manner. However, the majority of existing methods are inefficient, and the majority of them fail to determine whether the two data sets are equivalent. This work initially offers a novel method based on 0-1 coding to encode the encrypted data in order to construct a millionaires' problem protocol that is simple, efficient, and meticulous differentiation between the size of two numbers or equal relationship. The homomorphic encryption algorithm and this method are used to create a protocol to address the millionaires' problem. The protocol is simple and efficient, according to the efficiency study. Finally, an efficient protocol based on the new protocol is created to solve the problem of the number of intersections.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/5343