The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Network structure has been used to describe many systems in the real world. Nodes, which represent the units, and edges, which represent the connection of the units constitute the network structure. The monitoring of the Peer-to-Peer (P2P) networks can also be described by the general network model. In this paper, we provide an algorithm to divide network based on the social network analysis. By calculating...
Data holders need to share the alerts data that they detected for correlation and analysis purpose. In such cases, privacy issues turn out to be a major concern. This paper proposes a model to correlate and analyze intrusion alerts with privacy-preserving capability. The raw intrusion alerts are protected by improved k-anonymity method, which preserves the alert regulation inside disturbed data records...
Despite the immense potential of Peer-to-Peer (P2P) networks in facilitating collaborative applications, they are generally considered to be free havens for pirated multimedia content. Ensuring the proper distribution and usage of multimedia content in P2P networks has become increasingly critical. Encryption can provide multimedia contents with the desired security during transmission, which disappears...
In P2P file-sharing applications, distributed virtual payment mechanism is designed to encourage resource sharing among peers and thus restrain free-riding behaviors. However, it does not provide any protection on the security of the transaction process and the quality of the trading contents. We design a fair transaction mechanism for P2P file-sharing applications, in which a trusted third party...
Many P2P applications necessitate statistics aggregate computation of certain information among all individual peers. In contrast to methods of constructing aggregation tree, centralized computing and flooding, gossip-based mechanism has the advantages of good robustness and moderate communication and computing costs. Most algorithms of this type perform aggregate computation recursively on successive...
P2P applications suffer from free-riding. In economics terminology, free-riding is the rational behavior of the participants. So it's feasible to use game theory to analyze this problem and design countermeasures. Tit-For-Tat is a simple and efficient equilibrium strategy in repeated game environments. In this paper, we construct a game model in P2P environments and deduce the constraint under which...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.