In recent years, secure multi-party computing has been a significant research subject of international cryptography. The most fundamental and significant problem of stable multi-party computation is the problem of millionaires studied in this paper. The essence is to compare the size of two data confidentially. But most of the current solutions are inefficient, even if all data are comparable, most of them don't do a good job of assessing. This paper first proposes a new method based on 0-1 coding to encode the encrypted data in order to design a protocol of the problem of the millionaires that is simple, effective and meticulous distinction between the size of two numbers or equal relationship. To build a protocol to solve the issue of millionaires, this approach and the homomorphic encryption algorithm are used. The study of efficiency indicates that the protocol is simple and efficient. Finally, an effective protocol is designed to calculate the number of problem intersections based on the new protocol.
Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/5343
No comments:
Post a Comment