Unlock instant, AI-driven research and patent intelligence for your innovation.
Vertical partition data PPARM method based on multi-party set intersection solving
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of vertical partitioning and data, applied in the electronic field, can solve the problems of limitations, large amount of communication in the interaction stage, and insufficient privacy protection, and achieve the effect of weakening assumptions and ensuring security.
Active Publication Date: 2021-06-15
XIDIAN UNIV
View PDF6 Cites 9 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
In summary, the existing technology has technical problems such as large communication volume in the interaction phase, insufficient privacy protection, and limitations.
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0056] refer to figure 1 , a kind of vertical partition data PPARM method that the present invention proposes based on multi-party sets to intersect, comprises the following steps:
[0057] Step 1, Party A i Generate an encrypted public-private key pair (pk i ,sk i ) and the hash function H i (·), where i=1,2,...,n represents the participant number, n represents the total number of participants; among n participants, let the first n-1 be the sender A l , the nth one is receiver A n ;Sender A l contains the primary sender A q and secondary sender A n-1 , where q=1,2,...,n-2;
[0058] Step 2, data preprocessing:
[0059] (2.1) For sender A l Input s-dimensional vector data sender A l Use the idea of hash allocation bucket to process the vector data to get the processed data Among them, l=1,2,...,n-1 represents the number of the sender; specifically, it can be obtained as follows:
[0060] (2.1.1) According to the following formula, for each input sender A l Th...
Embodiment 2
[0120] The PPARM method for vertically partitioned data based on the intersection of multi-party sets provided in this embodiment is the same as in Embodiment 1, and its specific implementation steps can also be summarized as follows:
[0121] Step 1, each participant A l Preprocessing your own data is mainly divided into three stages:
[0122] (1) Block stage. According to the following formula, for each sender A l (l=1,2,...,n-1) The input s-dimensional vector is divided into blocks:
[0123]
[0124] in, is sender A l input, F=4r l blocks, where r l by A l Randomly selected, the size is about the average value of the actual items in each transaction set, and there are at most E elements in each block;
[0125] (2) Hash stage. sender A l Use your own hash function H l Hash each element in the divided block;
[0126] (3) Encryption stage. For any block X l (h) , A l produces a polynomial Q of degree E l (h) , then sender A l Use the public key pk of you...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses a vertical partition data PPARM method based on multi-party set intersection solving, and mainly solves the technical problems of high communication traffic cost and insufficient privacy protection in the prior art. The scheme comprises the following steps: 1) a sender preprocesses data; 2) a first protocol execution stage: firstly, a sender encrypts a random matrix, and a receiver calculates an encryption intermediate value by using a homomorphic encryptionalgorithm; then, the sender performs result verification by using the collision resistance of the hash function; finally, the receiver decrypts to obtain the support degree; and 3) an execution stage of the second protocol: the difference between the stage and the protocol I is that a verification result is firstly subjected to blind processing so as to cover the real support degree, and finally, security comparison is carried out. According to the invention, along with the increase of participating sites, when the privacy level I is reached, the number of communication rounds is small, and when the privacy level II is reached, a completely trusted third-party server does not need to be introduced; therefore, the communication cost is effectively reduced, and the information privacy is improved.
Description
technical field [0001] The invention belongs to the field of electronic technology, and further relates to a set intersection technology, specifically a PPARM method for mining vertically partitioned data privacy protection association rules based on multi-party set intersection. It can be used to encrypt the information of each site on the vertical partition to realize the privacy protection of the site information. Background technique [0002] With the rapid development of data collection and storage technology, as well as the improvement of the convenience of data generation and dissemination, the explosive growth of data has finally formed the current era of big data. Actionable insight into these data sets for decision-making has become increasingly important in every domain of society, including business and industry, science and engineering, and government and individuals. However, the volume, variety, and speed at which data is collected and processed are too large...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.