Verifiable distributed privacy data comparing and sorting method and device

Abstract

The invention relates to the field of secure multi-party computation, in particular to a verifiable distributed privacy data comparing and sorting method and a device. The method and the device have the beneficial effects that through the steps of sorting the privacy data of n client sides by using a distributed client side initialization, inquirer initialization and inquirer Pa use merge sorting algorithm and the like; aiming at the situation that the data is stored on a large quantity of distributed nodes, a ceterless mode is completely adopted in the whole inquiry process by utilizing a digital signature and a semi-homomorphic encryption system; all the client side data is encrypted by using a client side public key and is only decrypted by a client side private key to ensure data privacy; and through a verification mechanism, all client sides can not input false data and can also not affectedly behave the comparing and sorting results.

Description

technical field [0001] The invention relates to the field of secure multi-party computing, in particular to a method and device for comparing and sorting verifiable distributed privacy data. Background technique [0002] Data size comparison and sorting operations are often used in various data-related applications. With the development of modern information technology, the storage of many data is no longer a central storage method, but distributed on multiple clients. . For example, the sensing data and network data collected by the nodes in the sensor network are distributed on each sensor node; the data in the mobile social network are distributed on the mobile phones of each user; the data in the distributed database are stored on multiple servers respectively. Wait. How to compare the data distributed on different clients and how to sort the data on multiple clients is a challenging topic. At present, a large number of distributed computing methods have been proposed...

AI Technical Summary

Problems solved by technology

[0003] Traditional secure multi-party computing methods have a very high computational overhead, especially on mobile devices with limited computing resources, which makes them difficult to be practically applied in many scenarios such as sensor networks and mobile social networks.

And all related solutions focus on privacy protection to ensure that data is not leaked, while ignoring the verifiability of computing input and results

The correctness of the comparison and sorting results obtained by the query using these methods is based on the assumption that the client implements the method honestly. In fact, malicious clients can easily forge their input and output data and cause wrong comparison and sorting results. However, traditional methods are difficult to verify and discover such situations

Such an unverifiable calculation method obviously cannot meet the needs of a large number of high-security applications.

Images