55 research outputs found
Graffiti Networks: A Subversive, Internet-Scale File Sharing Model
The proliferation of peer-to-peer (P2P) file sharing protocols is due to
their efficient and scalable methods for data dissemination to numerous users.
But many of these networks have no provisions to provide users with long term
access to files after the initial interest has diminished, nor are they able to
guarantee protection for users from malicious clients that wish to implicate
them in incriminating activities. As such, users may turn to supplementary
measures for storing and transferring data in P2P systems. We present a new
file sharing paradigm, called a Graffiti Network, which allows peers to harness
the potentially unlimited storage of the Internet as a third-party
intermediary. Our key contributions in this paper are (1) an overview of a
distributed system based on this new threat model and (2) a measurement of its
viability through a one-year deployment study using a popular web-publishing
platform. The results of this experiment motivate a discussion about the
challenges of mitigating this type of file sharing in a hostile network
environment and how web site operators can protect their resources
Library Blogs and User Participation: A Survey about Comment Spam in Library Blogs
The purpose of this research is to identify and describe the impact of comment spam in library blogs. Three research questions guided the study: current level of commenting in library blogs; librarians' perception of comment spam; and techniques used to address the comment spam problem
Using Spammers\u27 Computing Resources for Volunteer Computing
Spammers are continually looking to circumvent counter-measures seeking to slow them down. An immense amount of time and money is currently devoted to hiding spam, but not enough is devoted to effectively preventing it. One approach for preventing spam is to force the spammer\u27s machine to solve a computational problem of varying difficulty before granting access. The idea is that suspicious or problematic requests are given difficult problems to solve while legitimate requests are allowed through with minimal computation. Unfortunately, most systems that employ this model waste the computing resources being used, as they are directed towards solving cryptographic problems that provide no societal benefit. While systems such as reCAPTCHA and FoldIt have allowed users to contribute solutions to useful problems interactively, an analogous solution for non-interactive proof-of-work does not exist. Towards this end, this paper describes MetaCAPTCHA and reBOINC, an infrastructure for supporting useful proof-of-work that is integrated into a web spam throttling service. The infrastructure dynamically issues CAPTCHAs and proof-of-work puzzles while ensuring that malicious users solve challenging puzzles. Additionally, it provides a framework that enables the computational resources of spammers to be redirected towards meaningful research. To validate the efficacy of our approach, prototype implementations based on OpenCV and BOINC are described that demonstrate the ability to harvest spammer\u27s resources for beneficial purposes
BlogForever: D2.5 Weblog Spam Filtering Report and Associated Methodology
This report is written as a first attempt to define the BlogForever spam detection strategy. It comprises a survey of weblog spam technology and approaches to their detection. While the report was written to help identify possible approaches to spam detection as a component within the BlogForver software, the discussion has been extended to include observations related to the historical, social and practical value of spam, and proposals of other ways of dealing with spam within the repository without necessarily removing them. It contains a general overview of spam types, ready-made anti-spam APIs available for weblogs, possible methods that have been suggested for preventing the introduction of spam into a blog, and research related to spam focusing on those that appear in the weblog context, concluding in a proposal for a spam detection workflow that might form the basis for the spam detection component of the BlogForever software
Carp A Novel Approach To Address The Well-Known Image Hotspot Problem In Popular Graphical Password Systems
In a novel safety pre-historic based on hard AI problems, that is, a new relations of graphical password systems put together Captcha knowledge, which we call CaRP (Captcha as gRaphical Passwords). CaRP is click-based graphical passwords, where a series of clicks on a picture is used to gain a password. Different other click-based graphicalpasswords, images used in CaRP are Captcha confront, and a new CaRP image is make for every login effort. Captcha is now a criterion Internet security method to defend onlineemail and other services from creaturebattered by bots. This new concept has get just anincompleteachievement as evaluate with the cryptographic primitives basedon solid math problems and their extensive applications. This is a demanding and motivating open trouble
Video Chat Application for Facebook
This project is mainly written for the facebook users. In todayâs world, there are many social networking sites available. Among those social networking web sites, facebook is widely used web site. Like all other social networking web sites, Facebook also provides many features to attract more and more users. But it lacks in providing the most important feature of social networking, i.e. video chat. I explore the different options and requirements needed to build the video chat application. I have also described the integration of the application with the facebook
A Novel Security Scheme against Spyware using Sequence Selection of CAPTCHA as Graphical Password
our proposed work will be founded on Click-based graphical secret word plans require a client to tap on an arrangement of focuses on one or more exhibited foundation pictures. With Pass Points, clients make a secret word by clicking five requested focuses anyplace on the given picture. To sign in, clients should accurately rehash the succession of snaps, with every snap falling inside of a satisfactory resilience of the first point. To actualize this angle, alongside a plan changing over the client entered graphical secret key into a cryptographic check key, a "vigorous discretization" plan. It comprised of three covering lattices (imperceptible to the client) used to figure out if the snap purposes of a login endeavor were sufficiently close to the first indicates be acknowledged
Spyware prevention using graphical passwords
our future work will be based on Click-based graphical password schemes require a user to click on a set of points on one or more presented background images. With the Pass Points and to create users to a password by clicking five ordered points anywhere on the given image. Â CaRP addresses a number of security problems altogether, such as online guessing attacks, relay attacks, and, if combined with dual-view technologies, shoulder-surfing attacks. Notably, a CaRP password can be found only probabilistically by automatic online guessing attacks even if the password is in the search set. To log in, users must correctly the repeated sequence of clicks, with each click falling within the acceptable tolerance of original point. To implemented this aspect, along with a scheme converting the user-entered graphical password into a cryptographic verification key and ârobust discretizationâ scheme. It consisted of three overlapping grids (invisible to the user) used to determine whether the click-points are login attempt were close enough to the original points to be accepted.
- âŠ