Secure-Mining-of-Association-Rules-in-Horizontally-Distributed-Databases

ABSTRACT: We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton. Our protocol, like theirs, is based on the Fast Distributed ining !FD " algorithm of Cheung et al. #hich is an unsecured distributed $ersion of the %priori algorithm. The main ingredients in our protocol are t#o no$el secure multi&party algorithms ' one that computes the union of pri$ate subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol offers enhanced pri$acy #ith respect to the protocol. (n addition, it is simpler and is significantly more efficient in terms of communication rounds, communication cost and computational cost. EXISTING SYSTEM: Kantarcioglu and Clifton studied that problems and de$ised a protocol for its solution. The main part of the protocol is a sub&protocol for the secure computation of the union of pri$ate subsets that are held by the different players. !The pri$ate subset of a gi$en player, as #e e)plain belo#, includes the item sets that are s&fre*uent in his partial database. That is the most costly part of the protocol and its implementation relies upon cryptographic primiti$es such as commutati$e encryption, obli$ious transfer, and hash functions. This is also the only part in the protocol in #hich the players may e)tract from their $ie# of the protocol information on other databases, beyond #hat is implied by the final output and their o#n input. While such leakage of information renders the protocol not perfectly secure, the perimeter of the e)cess information is e)plicitly bounded and it is argued there that such information leakage is innocuous, #hence acceptable from a practical point of $ie#. DISADVANTAGES OF EXISTING SYSTEM: (nsufficient security, simplicity and efficiency are not #ell in the databases, not sure in pri$acy in an e)isting system. While our solution is still not perfectly secure, it leaks e)cess information only to a small number !three" of possible coalitions, unlike the protocol of that discloses information also to some single players.

Contact: 040-40274843, 9703109334 Email id: academicliveprojects@gmail.com !!!.logicsystems.org.in

Secure-Mining-of-Association-Rules-in-Horizontally-Distributed-Databases

Our protocol may leak is less sensiti$e than the e)cess information leaked by the protocol.

PROPOSED SYSTEM: The protocol that #e propose here computes a parameterized family of functions, #hich #e call threshold functions, in #hich the t#o e)treme cases correspond to the problems of computing the union and intersection of pri$ate subsets. Those are in fact general&purpose protocols that can be used in other conte)ts as #ell. %nother problem of secure multiparty computation that #e sol$e here as part of our discussion is the set inclusion problem+ namely, the problem #here %lice holds a pri$ate subset of some ground set, and ,ob holds an element in the ground set, and they #ish to determine #hether ,ob-s element is #ithin %lice-s subset, #ithout re$ealing to either of them information about the other party-s input beyond the abo$e described inclusion. ADVANTAGES OF PROPOSED SYSTEM: We proposed a protocol for secure mining of association rules in horizontally distributed databases that impro$es significantly upon the current leading protocol in terms of pri$acy and efficiency. The main ingredient in our proposed protocol is a no$el secure multi&party protocol for computing the union !or intersection" of pri$ate subsets that each of the interacting players holds. SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS:

. . . . . .

/ystem 6ard Disk

0 1entium (2 3.4 56z. 0 47 5,. b. 0 89 25% Colour. 0 :ogitech. 0 983 b.

Floppy Dri$e 0 8.44 onitor ouse ;am

Contact: 040-40274843, 9703109334 Email id: academicliveprojects@gmail.com !!!.logicsystems.org.in

Secure-Mining-of-Association-Rules-in-Horizontally-Distributed-Databases

SOFTWARE REQUIREMENTS:

. . .

Operating system Coding :anguage Data ,ase

0 & Windo#s <1. 0 %/1.=>T, C?.=et. 0 /@: /er$er 3779

REFERENCE: Tamir Tassa A/ecure ining of %ssociation ;ules in 6orizontally Distributed DatabasesB IEEE

TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013

Contact: 040-40274843, 9703109334 Email id: academicliveprojects@gmail.com !!!.logicsystems.org.in