期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：5
DOI：10.15680/ijircce.2015.0305146
出版社：S&S Publications
摘要：An algorithm for sharing of private data among N parties is developed. This work deals with efficientalgorithms for assigning identifiers (IDs) to the nodes of a network in such a way that the IDs are anonymous using adistributed computation with no central authority. Given N nodes, this assignment is essentially a permutation of theintegers {1….N} with each ID being known only to the node to which it is assigned. Resistance to collusion amongother members is verified in an information theoretic sense when private communication channels are used. Thisassignments of IDs allows complex data to be shared and has applications in privacy preserving data mining,collision avoidance in communications and distributed database access. Existing and new algorithms for assigning IDsare examined with respect to trade-offs between communicational and computational requirements. New algorithms arebuilt on top of secure sum data mining operations using Newtons identities.Markov chain representations are used tofind statistics of number of iterations. . In this system, owner is assigned a randomly generated encrypted ID, withwhich data stored in the database is encrypted. This ensures confidentiality of the data. Another party can access dataonly if permission is granted by the owner. Also a comparison study based on different encryption methods areperformed. The required computations are distributed without using a trusted central authority.
关键词：data mining; collision to resistance; Newtons identities
