Privacy Preserving Data Sharing With Anonymous ID
2016-08-23
1 0 0
4.0
Other
Earn points
Algorithm for anonymous data sharing between private parties. This technique is used iteratively to assign these node ID numbers from 1 to 2. This task is anonymous in the group received by other members with unknown identity. The collusion resistance between other members is verified by using private communication channels in the theoretical sense of information. The sequence number of this assignment allows for more complex data sharing, with privacy protection for applications in other issues, data mining, communication and distributed database access, avoiding collisions. The required computation is distributed without the use of a trusted central authority. Existing and new algorithms are used to assign anonymous IDs to communicate between trade-offs and to safely sum data mining operations using Newton identities and stum theorem checking. Some polynomial algorithms over finite fields of a distributed solution improve the scalability of the algorithm. Markov chains represent the statistics and computer algebra used to find the number of iterations required on the search, and give closed form results for the completion rate.
ID
共享
数据
分配
匿名
隐私保护
Related Source Codes
Golang AOA Android Open Accessory HID Control
0
0
no vote
Linear regression analysis
0
0
no vote
Spring boot+android realizes login and registratio
0
0
no vote
Processing null values with linear difference
0
0
no vote
Pid data
0
0
no vote
No comment