Search

ABSTRACT Content pollution is one of the most common attacks against peer-to-peer file-sharing systems. As such, systems are usually open to users, and the deployed security mechanisms merely examine the sanity of the downloaded files-content pollution attacks can be easily launched. InfoRanking is a mechanism that tries to mitigate this security risk by ranking content items. In this paper, we show through analysis, fluid modeling, and simulation that when InfoRanking is used, attackers can deceive users only when they share corrupted copies of legitimate file versions. Nevertheless, as corrupted files can be immediately detected after being downloaded, this attack is only effective when users enter the system at very low rate and leave relatively fast. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Purpose - The purpose of this paper is to propose the use of priority-based incentives for collaborative hiding of confidential information in dynamic environments, such as self-organized networks, peer-to-peer systems, pervasive and grid computing applications. Design/methodology/approach - The paper documents the necessity of ISSON (Incentives for Secret-sharing in Self-Organised Networks); it provides functional and technical details on the proposed architecture; and, it assesses its feasibility in mobile ad-hoc networks through real experiments. The paper elaborates on the availability of the hidden information through an analytical framework. Findings - Through the real experiments, ISSON was found to be efficient in terms of communication and processing costs. Additionally, it avoids collusions for unauthorized revealing of the hidden information, and ensures the unlinkability and availability of the secret when it is divided and stored to peers. Originality/value - The proposed, incentive-based, privacy enforcement architecture is novel and applies to distributed, dynamic, and self-configured computing environments. [ABSTRACT FROM AUTHOR]