Privacy Preserving Data
Sharing With Anonymous ID Assignment
ABSTRACT:
An algorithm for anonymous
sharing of private data among parties is developed. This technique is used
iteratively to assign these nodes ID numbers ranging from 1 to N. This assignment is anonymous in that
the identities received are unknown to the other members of the group.
Resistance to collusion among other members is verified in an information
theoretic sense when private communication channels are used. This assignment
of serial numbers allows more complex data to be shared and has applications to
other problems in privacy preserving data mining, collision avoidance in
communications and distributed database access. The required computations are
distributed without using a trusted central authority. Existing and new
algorithms for assigning anonymous IDs are examined with respect to trade-offs
between communication and computational requirements. The new algorithms are
built on top of a secure sum data mining operation using Newton’s identities
and Sturm’s theorem. An algorithm for distributed solution of certain
polynomials over finite fields enhances the scalability of the algorithms.
Markov chain representations are used to find statistics on the number of
iterations required, and computer algebra gives closed form results for the
completion rates.
EXISTING SYSTEM:
A secure
computation function widely used in the literature is secure sum that allows
parties to compute the sum of their individual inputs without disclosing the inputs
to one another. This function is popular in data mining applications and also
helps characterize the complexities of the secure multiparty computation.
DISADVANTAGES
OF EXISTING SYSTEM:
The algorithms for mental poker are more
complex and utilize cryptographic methods as players must, in general, be able
to prove that they held the winning hand. Throughout this paper, we assume that
the participants are semi-honest, also known as passive or
honest-but-curious, and execute their required protocols faithfully. Given a
semi-honest, reliable, and trusted third party, a permutation can also be
created using an anonymous routing protocol.
PROPOSED SYSTEM:
This work deals with efficient
algorithms for assigning identifiers (IDs) to the nodes of a network in such a
way that the IDs are anonymous using a distributed computation with no central authority.
Given N nodes, this assignment is essentially a permutation of the integers {1,…..N}
with each ID being known only to the node to which it is assigned. Our main
algorithm is based on a method for anonymously sharing simple data and results
in methods for efficient sharing of complex data.
Despite the differences cited, the
reader should consult and consider the alternative algorithms mentioned above
before implementing the algorithms in this paper. This paper builds an
algorithm for sharing simple integer data on top of secure sum. The sharing
algorithm will be used at each iteration of the algorithm for anonymous ID
assignment (AIDA). This AIDA algorithm, and the variants that we discuss, can
require a variable and unbounded number of iterations.
The work reported in this paper further
explores the connection between sharing secrets in an anonymous manner,
distributed secure multiparty computation and anonymous ID assignment. The use
of the term “anonymous” here differs from its meaning in research dealing with
symmetry breaking and leader election in anonymous networks. Our network is not
anonymous and the participants are identifiable in that they are known to and
can be addressed by the others. Methods for assigning and using sets of
pseudonyms have been developed for anonymous communication in mobile networks.
The methods developed in these works generally require a trusted administrator,
as written, and their end products generally differ from ours in form and/or in
statistical properties.
ADVANTAGES
OF PROPOSED SYSTEM:
Increasing a parameter in the algorithm
will reduce the number of expected rounds. However, our central algorithm
requires solving a polynomial with coefficients taken from a finite field of
integers modulo a prime. That task restricts the level to which can be
practically raised. We show in detail how to obtain the average number of
required rounds, and in the Appendix detail a method for solving the
polynomial, which can be distributed among the participants.
ALGORITHMS USED:
1) Secure Sum
2) Anonymous Data Sharing with Power Sums
3) Find AIDA
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
ü Processor - Pentium –IV
ü Speed - 1.1
Ghz
ü RAM - 256
MB(min)
ü Hard Disk -
20 GB
ü Key Board -
Standard Windows Keyboard
ü Monitor - SVGA
SOFTWARE CONFIGURATION:-
ü Operating System : Windows
XP
ü Programming Language :
ASP.NET,C#.NET
ü DATABASE : SQL SERVER 2005
ü Tool :
Visual Studio 2008.
REFERENCE:
Larry A. Dunning, Member, IEEE,
and Ray Kresman-“Privacy Preserving Data Sharing With Anonymous ID Assignment”-IEEE TRANSACTIONS ON INFORMATION FORENSICS
AND SECURITY, VOL. 8, NO. 2, FEBRUARY 2013
