5,994 research outputs found
X-Vine: Secure and Pseudonymous Routing Using Social Networks
Distributed hash tables suffer from several security and privacy
vulnerabilities, including the problem of Sybil attacks. Existing social
network-based solutions to mitigate the Sybil attacks in DHT routing have a
high state requirement and do not provide an adequate level of privacy. For
instance, such techniques require a user to reveal their social network
contacts. We design X-Vine, a protection mechanism for distributed hash tables
that operates entirely by communicating over social network links. As with
traditional peer-to-peer systems, X-Vine provides robustness, scalability, and
a platform for innovation. The use of social network links for communication
helps protect participant privacy and adds a new dimension of trust absent from
previous designs. X-Vine is resilient to denial of service via Sybil attacks,
and in fact is the first Sybil defense that requires only a logarithmic amount
of state per node, making it suitable for large-scale and dynamic settings.
X-Vine also helps protect the privacy of users social network contacts and
keeps their IP addresses hidden from those outside of their social circle,
providing a basis for pseudonymous communication. We first evaluate our design
with analysis and simulations, using several real world large-scale social
networking topologies. We show that the constraints of X-Vine allow the
insertion of only a logarithmic number of Sybil identities per attack edge; we
show this mitigates the impact of malicious attacks while not affecting the
performance of honest nodes. Moreover, our algorithms are efficient, maintain
low stretch, and avoid hot spots in the network. We validate our design with a
PlanetLab implementation and a Facebook plugin.Comment: 15 page
Sybil attacks against mobile users: friends and foes to the rescue
Collaborative applications for co-located mobile
users can be severely disrupted by a sybil attack to the point of
being unusable. Existing decentralized defences have largely been
designed for peer-to-peer networks but not for mobile networks.
That is why we propose a new decentralized defence for portable
devices and call it MobID. The idea is that a device manages two
small networks in which it stores information about the devices
it meets: its network of friends contains honest devices, and its
network of foes contains suspicious devices. By reasoning on these
two networks, the device is then able to determine whether
an unknown individual is carrying out a sybil attack or not.
We evaluate the extent to which MobID reduces the number
of interactions with sybil attackers and consequently enables
collaborative applications.We do so using real mobility and social
network data. We also assess computational and communication
costs of MobID on mobile phones
A Review on Preventing Insider Threats and Stealthy Attacks from Sonet Site
Online social networks (OSNs) give another measurement to individuals' lives by bringing forth online social orders. OSNs have upset the human experience, however they have likewise made a stage for gatecrashers to disperse diseases and direct cybercrime. An OSN gives an entrepreneurial assault stage to cybercriminals through which they can spread contaminations at a huge scale. Assailants perform unapproved and malevolent exercises on OSN. Assaults can be an executable document, an expansion, an adventure code, and so on., that behaviors malignant tasks in OSNs with genuine effect on clients. Moreover, Intruders influence OSNs with different intensions, for example, to take basic information and adapt it for monetary profits. Insider dangers have turned into a genuine worry for some associations today. A model for OSN is to introduced to avoid insider danger misuses and to protect the classification. Multilevel security instrument is connected amid the enlistment and login level. At enlistment organize one time randomized alphanumeric watchword will be created and send to the clients by means of email though at login arrange randomized graphical secret word will be connected to counteract non malignant movement
Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments
Decentralized systems are a subset of distributed systems where multiple
authorities control different components and no authority is fully trusted by
all. This implies that any component in a decentralized system is potentially
adversarial. We revise fifteen years of research on decentralization and
privacy, and provide an overview of key systems, as well as key insights for
designers of future systems. We show that decentralized designs can enhance
privacy, integrity, and availability but also require careful trade-offs in
terms of system complexity, properties provided, and degree of
decentralization. These trade-offs need to be understood and navigated by
designers. We argue that a combination of insights from cryptography,
distributed systems, and mechanism design, aligned with the development of
adequate incentives, are necessary to build scalable and successful
privacy-preserving decentralized systems
Preserving Link Privacy in Social Network Based Systems
A growing body of research leverages social network based trust relationships
to improve the functionality of the system. However, these systems expose
users' trust relationships, which is considered sensitive information in
today's society, to an adversary.
In this work, we make the following contributions. First, we propose an
algorithm that perturbs the structure of a social graph in order to provide
link privacy, at the cost of slight reduction in the utility of the social
graph. Second we define general metrics for characterizing the utility and
privacy of perturbed graphs. Third, we evaluate the utility and privacy of our
proposed algorithm using real world social graphs. Finally, we demonstrate the
applicability of our perturbation algorithm on a broad range of secure systems,
including Sybil defenses and secure routing.Comment: 16 pages, 15 figure
- …