JAVA 2013 IEEE CLOUDCOMPUTING PROJECT Outsourcing privacy preserving social networks to a cloud
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share

JAVA 2013 IEEE CLOUDCOMPUTING PROJECT Outsourcing privacy preserving social networks to a cloud

  • 499 views
Uploaded on

To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
No Downloads

Views

Total Views
499
On Slideshare
499
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
9
Comments
0
Likes
1

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. Outsourcing Privacy-Preserving Social Networks to a Cloud ABSTRACT In the real world, companies would publish social networks to a third party, e.g., a cloud service provider, for marketing reasons. Preserving privacy when publishing social network data becomes an important issue. In this paper, we identify a novel type of privacy attack, termed 1*-neighborhood attack. We assume that an attacker has knowledge about the degrees of a target’s one-hop neighbors, in addition to the target’s 1-neighborhood graph, which consists of the one-hop neighbors of the target and the relationships among these neighbors. With this information, an attacker may re-identify the target from a k-anonymity social network with a probability higher than 1/k, where any node’s 1-neighborhood graph is isomorphic with k−1 other nodes’ graphs. To resist the 1*-neighborhood attack, we define a key privacy property, probability indistinguishability, for an outsourced social network, and propose a heuristic indistinguishable group anonymization (HIGA) scheme to generate an anonymized social network with this privacy property. The empirical study indicates that the anonymized social networks can still be used to answer aggregate queries with high accuracy. Existing System Social networks model social relationships with a graph structure using nodes and edges, where nodes model individual social actors in a network, and edges model relationships between social actors. The relationships between social actors are often private, and directly outsourcing the social networks to a cloud may result in unacceptable disclosures. For example, publishing social network data that describes a set of social actors related by sexual contacts or shared drug injections may compromise the privacy of the social actors involved. Therefore, existing research has proposed to anonymize social networks before outsourcing. GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. Disadvantage: 1) users can only explicitly specify a group of users who can or cannot access the location information. 2) access control policy supports binary choices only, which means users can only choose to enable or disable the information disclosure. The existing control strategies also suffer from privacy leakage in terms of the server storage. Proposed System: To permit useful analysis on the social networks, while preserving the privacy of the social actors involved, we define a key privacy property, probabilistic indistinguishability, for an outsourced social network. To generate an anonymized social network with such a property, we propose a heuristic indistinguishable group anonymization (HIGA) scheme. Our basic idea consists of four key steps: Grouping, we group nodes whose 1*- neighborhood graphs satisfy certain metrics together, and provide a combination and splitting mechanism to make each group size at least equal to k; Testing, in a group, we use random walk (RW) to test whether the 1- neighborhood graphs of any pair of nodes approximately match or not; Anonymization, we propose a heuristic anonymization algorithm to make any node’s 1-neighborhood graph approximately match those of other nodes in a group, by either adding or removing edges ; Randomization, we randomly modify the graph structure with a certain probability to make sure each 1*-neighborhood graph has a certain probability of being different from the original one. Advantages: In this project, we identify a novel 1*-neighborhood attack. To resist this attack, we define a key property, probabilistic indistinguishability for outsourced social networks, and we propose a heuristic anonymization scheme to anonymize social networks with this property.
  • 3. Architecture: MODULES” 1. 1-Neighborhood Graph. 2. Privacy. 3. Usability. 4. Naive approach. 5. Heuristic Indistinguishable Group Anonymization Modules Description 1. 1-Neighborhood Graph In this paper, we assume that the attacker is more interested in the privacy of social actors. Before launching an attack, the attacker needs to collect some background knowledge about the target victim. We assume that an attacker may have background knowledge about the 1*-neighborhood graphs of some
  • 4. targets. Informally, a target’s 1*-neighborhood graph consists of both the 1-neighborhood graph of the target and the degrees of the target’s one-hop neighbors. 2. Privacy Given any target’s 1-*neighborhood graph, the attacker cannot re-identify the target from an anonymized social network with confidence higher than a threshold. 3. Usability The anonymized social networks can be used to answer aggregate queries with high accuracy. 4. Naive approach A naive approach is to simply anonymize the identity of the social actors before outsourcing. However, an attacker that has some knowledge about a target’s neighborhood, especially a one-hop neighborhood, can still re-identify the target with high confidence. This attack, termed 1-neighborhood attack. 5. Heuristic Indistinguishable Group Anonymization Grouping classifies nodes whose 1*-neighborhood graphs satisfy certain metrics into groups, where each group size is at least equal to k. Testing uses random walk (RW) to test whether the 1- neighborhood graphs of nodes in a group approximately match or not. Anonymization uses a heuristic anonymization algorithm to make the 1-neighborhood graphs of nodes in each group approximately match. Randomization randomly modifies the graph with certain probability to make each node’s 1*- neighborhood graph be changed with certain probability.
  • 5. System Configuration:- H/W System Configuration:- Processor - Pentium –III Speed - 1.1 Ghz RAM - 256 MB (min) Hard Disk - 20 GB Floppy Drive - 1.44 MB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA S/W System Configuration:-  Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp  Scripts : JavaScript.  Server side Script : Java Server Pages.  Database : Mysql  Database Connectivity : JDBC.
  • 6. CONCLUSION In this project, we identify a novel 1*-neighborhood attack. To resist this attack, we define a key property, probabilistic indistinguishability for outsourced social networks, and we propose a heuristic anonymization scheme to anonymize social networks with this property. The empirical study indicates that the anonymized social networks can still be used to answer aggregate queries with high accuracy.
  • 7. CLOUING DOMAIN: WIRELESS NETWORK PROJECTS