Dotnet

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 trustedcentral 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.

SYSTEM ANALYSIS

EXISTING SYSTEM:

          Existing and new algorithms for assigning anonymous IDs are examined with respect to trade-offs between communication and computational requirements.. Also, suppose that access to the database is strictly controlled, because data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob; on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting Alice and Bob know the contents of the tuple and the database respectively.

Disadvantage:

1. The database with the tuple data does not be maintained confidentially.
2. The existing systems another person to easily access database.

PROPOSED SYSTEM:

            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 trustedcentral authority.

Advantage:

1. The anonymity of DB is not affected by inserting the records.
2. We provide security proofs and experimental results for both protocols.

MODULES

1.      Homomorphic encryption Module.

2.      Generalization Module.

3.      Cryptography Module.

4.   User and Admin Module.

Homomorphic encryption Module:

          This module to use the first protocol is aimed at suppression-based anonymous databases, and it allows the owner of DB to properly anonymize the tuple t, without gaining any useful knowledge on its contents and without having to send to t’s owner newly generated data. To achieve such goal, the parties secure their messages by encrypting them. In order to perform the privacy-preserving verification of the database anonymity upon the insertion, the parties use a commutative and homomorphic encryption scheme.

Generalization Module:

In this module, the second protocol is aimed at generalization-based anonymous databases, and it relies on a secure set intersection protocol, such as the one found in, to support privacy-preserving updates on a generalization based k-anonymous DB.

Cryptography Module:

          In this module, the process of converting ordinary information called plain text into unintelligible gibberish called cipertext. Decryption is the reverse, in other words, moving from the unintelligible cipher text back to plaintext. A ciper (or) cypher is a pair of algorithms that create the encryption and the reversing decryption. The detailed operation of a cipher is controlled both by the algorithm and in each instance by a key.This is a secret parameter (ideally known only to the communicants) for a specific message exchange context.

User and Admin Module:

          In this module, to arrange the database based on the patient and doctor details and records. The admin to encrypt the patient reports using encryption techniques using suppression and generalization protocols.

SYSTEM SPECIFICATION

Hardware Requirements:

•         System                        :   Pentium IV 2.4 GHz.

•         Hard Disk       :   160 GB.

•         Floppy Drive   :   1.44 Mb.

•         Monitor           :   14’ Colour Monitor.

•         Mouse             :   Optical Mouse.

•         Ram                 :   1GB.

•         Keyboard        :   101 Keyboards.

Software Requirements:

•         Operating system        :   Windows 7, 32 Bit

•         Coding Language       :   ASP.Net with C#

•         Data Base                    :   SQL Server 2008.