期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2014
卷号：18
期号：2
页码：42-45
出版社：Seventh Sense Research Group
摘要：Algorithms for anonymous sharing of the private data between N parties are established. This technique is used iteratively to assign these nodes Id ranging from the number 1 to N. This assignment is anonymous in that the identities received are unknown to the other members of the group. The resistance to the collusion between other members is verified in an information theoretic sense when private communication channels are used. In this assignment of serial numbers allow much complex data to be shared and has application to other problem in privacy reserving data mining, collection avoidance in the communication and distributed without using the trusted fundamental authority. Current and new algorithm for the assigning anonymous IDs is examined with respect to the tradeoffs between communication and computational desires. The original algorithms are built on the top of a secure sum data mining operation using Newton's identities andsturm's theorem. The algorithm of distributed solution of certain polynomials over finite fields enhances a scalability of the algorithm. The Markov chain representation are the used tothe find the statistics on the number of the iterations required and the computer algebra gives closed form results for the completion rates. Index Terms areThe anonymization and the deanonymization, cloud and the distributed computing systems, multiparty computation, privacy preserving data mining, Privacy Protection, security and trust in cooperative communication.
关键词：Data Transformation by Privacy Preserving with Unknown ID Obligation
