Securely Sharing Data Using AIDA?

In this paper, we study the strategies for efficiently achieving data sharing among networks. Unlike the traditional research, we do not intend to identify the access patterns to facilitate the future requests. Instead, with such a kind of information presumably known in advance, our goal is to efficiently share the data items. Existing work is consisting of secure sum data mining operation using Newton’s identities and Sturm’s theorem. For achieving secure data sharing in distributed system, our algorithm is built for accurately work on such environment. It is the extended work over to traditional algorithm. In the proposed algorithm developed for anonymous sharing of private data among parties. Secret Identity assignment is consisting of hiding original identity, so that Anonymous ID assignment (AIDA) is used. This assignment of secret numbers allows more complex data to be shared and has applications to other problems in privacy preserving data mining. The required computations are distributed without using a trusted central authority.