Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Multi-party statistical query method based on differential privacy protection technology

A statistical query and differential privacy technology, applied in digital data protection, computing, computer security devices, etc., can solve the problems of complex design and difficult operation of secure multi-party computing protocols

Active Publication Date: 2019-09-10
DONGGUAN UNIV OF TECH
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, due to the complexity of basic theoretical research and the diversity of application problems, the design of traditional secure multi-party computing protocols is too complicated and difficult to operate

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
  • Multi-party statistical query method based on differential privacy protection technology

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0050] Suppose there are 4 parties involved, P 1 , P 2 , P 3 , P 4 ;

[0051] Step 1. Set P 1 , P 2 , P 3 , P 4 A number x for each of the four participants 1 = 3,x 2 = 4,x 3 =6,x 4 = 7, while assuming the selected ∈ = 0.01, u = 0;

[0052] Step 2: Set the participant P 1 , P 2 , P 3 , P 4 Each generate three satisfying Laplacian f(100,0) where b=100 is given by The obtained parameters are

[0053] x 1,2 =3.5,x 1,3 =121.2,x 1,4 =-129.2,x 2,1 =-2.5, x 2,3 =87.5,x 2,4 =-12.5, x 3,1 =-21.4,x 3,2 =176.4,x 3,4 =44.5,x 4,1 =-12.3, x 4,2 =20.4,x 4,3 =78.6;

[0054] Step three, such as figure 1 As shown, perform data exchange:

[0055] Each participant P i , Send the n-1 numbers generated by it to the remaining n-1 parties, and at the same time receive a number from the remaining n-1 parties; then update the value in your hand: subtract the n-1 numbers sent out digits, plus n-1 digits received, as follows:

[0056] P 1 to P 2 The number is 3.5, P ...

Embodiment 2

[0067] Suppose there are 4 parties involved, P 1 , P 2 , P 3 , P 4 ;

[0068] Step 1. Set P 1 , P 2 , P 3 , P 4 A number x for each of the four participants 1 = 3,x 2 = 4, x 3 =6,x 4 =7, the values ​​of all parties are already integers, no conversion is allowed;

[0069] Step two, put x 1 , x 2 , x 3 , x 4 Convert to binary numbers: 11, 100, 110, 111;

[0070] Step three, for x 1 , x 2 , x 3 , x 4 The converted binary number is filled according to m equal to 3 digits: 011, 100, 110, 111;

[0071] Step 4: Compare sequentially from the high bit, j is equal to increasing from the 1st bit to the 3rd bit:

[0072] j=1 calls the first summation protocol, calculates that s is equal to 3, s is greater than or equal to 1, and outputs the value t 1 =1, at the same time, P 1 The binary 1 behind it is all set to 0;

[0073] j=2 calls the summation protocol, calculates that s is equal to 2, s is greater than or equal to 1, and outputs the value t 2 =1, at the same ...

Embodiment 3

[0077] Suppose there are 4 parties involved, P 1 , P 2 , P 3 , P 4 ;

[0078] Step 1. Set P 1 , P 2 , P 3 , P 4 A number x for each of the four participants 1 =1.1,x 2 =2.4,x 3 =2.6,x 4 =0.3, in order to eliminate decimal places, all parties are multiplied by 10 according to the number of decimal places, at this time the numbers of all parties become 11, 24, 26, 3;

[0079] Step two, put x 1 , x 2 , x 3 , x 4 Convert to binary numbers: 1011, 11000, 11010, 11;

[0080] Step three, for x 1 , x 2 , x 3 , x 4 The converted binary number is filled according to m equal to 3 digits: 01011, 11000, 11010, 00011;

[0081]Step 4: Compare sequentially from the high bit, j is equal to increasing from the 1st bit to the 5th bit

[0082] j=1 calls the summation protocol, calculates that s is equal to 2, s is greater than or equal to 1, and outputs the value t 1 = 1, while P 1 , P 4 Set all 1s behind it to 0;

[0083] j=2 calls the summation protocol, calculates that ...

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

No PUM Login to View More

Abstract

The invention discloses a multi-party statistical query method based on a differential privacy protection technology. The method comprises the step of performing summation calculation in a multi-partyenvironment, includingdetermining n parties participating in the multi-party environment, determining a first numerical value in each party, and selecting a first numerical value and a second numerical value from the parties, generating n-1 different numerical values meeting the Laplace distribution of the first numerical value and the second numerical value in each party, selecting any participant in each party, performing data exchange calculation according to the different numerical values to obtain a third numerical value, and calculating the sum of the third numerical values of any participant; performing the maximum value calculation in the multi-party environment, comprising the following steps: determining n parties participating in the multi-party environment, respectively determining a plurality of fourth numerical values in the parties, converting the fourth numerical values into binary numerical values, and obtaining the maximum values of the output values in sequence according to the summation calculation process.

Description

technical field [0001] The invention relates to multi-party secure calculation, in particular to a multi-party statistical query method based on differential privacy protection technology. Background technique [0002] With the further development of information technology, cooperative computing among different organizations or individuals becomes more and more important. Different data owners need to exchange information through cooperative computing and obtain more comprehensive and valuable computing results. As the concept of win-win cooperation is becoming more and more popular, distributed computing research in computer science has become more and more important. However, data security and privacy protection issues restrict cooperative computing, and in some cases, all parties involved have to give up cooperation to ensure the security of private data. To solve this problem, more and more researchers are investing in the research of Secure Multi-party Computation (SM...

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
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/2458G06F21/62
CPCG06F21/6209G06F21/6245G06F16/2462
Inventor 何贤芒姜宇周坤晓毛续飞
Owner DONGGUAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products