Secure Multiparty Computation Of Sets

Since the 21st century,the ever-changing Internet technology has greatly contributed to the booming development of big data,and the collection,storage,sharing and analysis of data are becoming more and more frequent in various industries.While the flow of data is generating value,its security is facing unprecedented challenges.As an important research branch of cryptography,Secure Multiparty Computation provides technical support for collaborative computation by multiple participants in distributed computing scenarios without revealing private data.Confidential computation of sets is widely used in scenarios such as electronic elections,private data query,and location search,and has become a hot spot in secure multiparty computation research.In this paper,several problems of confidential computing of sets are studied,and the main work is as follows:For the confidential computation problem of integer sets,the corresponding conversation methods are proposed for the intersection and union operations on multiparty integer sets,which transform the sets into vectors.A new encoding method is proposed based on G?del coding.Combined with the El Gamal threshold encryption algorithm,the confidential computation protocols are designed for the intersection or union,and the simultaneous output of the intersection and union of multiparty integer sets.The security of the protocols is proved by applying the simulation paradigm under the semi-honest model.The complexity of protocols is analyzed theoretically.The execution efficiency of the protocols is tested experimentally.When the number of set elements satisfies certain conditions,the computational efficiency of these protocols is higher compared with existing protocols.For the confidential computation problem of the rational sets,based on the geometric encoding of rational numbers and combined with the confidential scalar product protocol,the confidential determination protocol of the relationship between element and set over rational numbers fields is designed,and the confidential computation protocols of the intersection or union of two rational multisets are proposed for the first time.The security of the protocols under the semi-honest model is demonstrated by using simulation paradigm.The computational efficiency of the protocols is verified by theoretical analysis and simulation tests.Compared with existing protocols,the designed protocols do not need to specify a universal set,which can protect the privacy of the set potential.Moreover,the multiplication operation is mainly used in the implementation of the protocols,which achieves the security of information theory.For the problem of determining the position relationship between rational number and rational interval,it is transformed into the problem of calculating the positive and negative vector scalar product.The confidential determination protocol for the position relationship between rational number and rational interval is designed by combining the confidential scalar product protocol.Based on the confidential computation protocol of rational number and rational interval,a confidential determination protocol of three types of position relations between two rational intervals is proposed.The security of the protocol is demonstrated under a semi-honest model by applying a simulation paradigm.The computational complexity and communication complexity of the protocols are analyzed theoretically.The execution efficiency of the protocols is tested experimentally,and the efficiency of these protocols is significantly improved compared with existing schemes.