A Lagrange's Polynomial Based Secure Mining Over Distributed Databases
In view of this brief description, it can be seen that all of these protocols for secure multiparty function evaluation run in unbounded \"Distributed time\" i.e. using an unbounded number of rounds of communications. Secure mining of association rule mining over horizontal databases is always an interesting research issue in the field of knowledge and data engineering. In horizontal partitioning or data bases, databases are integrated from various data holders or players for applying association rule mining over integrated database. In this paper, the authors are proposing a privacy preserving mining approach with Improved LaGrange's polynomial equation for secure key generation and Boolean matrix approach.