·
搜索结果:找到“P2P”相关结果28431条
排序: 按相关 按相关 按时间降序
  • 【期刊】 P2P and P2P botnet traffic classification in two stages

    刊名:Soft Computing 作者:Ye, Wujian ; Cho, Kyungsan 年份:2017
    摘要:
  • 【专利】 P2P GROUP DISCOVERY METHOD, RELATED DEVICE AND P2P GROUP

    作者:PANG, Gaokun ; FANG, Ping 年份:2015
    摘要:The present invention relates to the technical field of communications. Provided in embodiments of the present invention are a P2P group discovery method, related device and P2P group, the method comprising: determining, by a client device at a client device side, whether a GO device is required to protect device information of the client device; transmitting to the GO device a client device information protection instruction; acquiring, by the GO device at a GO device side, the client device information protection instruction; receiving a P2P query message transmitted by a P2P device; and determining, according to the acquired client device information protection instruction, whether to carry the client device information in a response message to be transmitted to the P2P device, and transmitting the response message to the P2P device. The present invention improves device information security of the client device.
  • 【期刊】 劝君慎入P2P P2P这事不能信明星

    摘要:2016年,在整个文化娱乐圈里,名人们最怕的词恐怕非“P2P”莫属。诸多P2P平台的老板跑路或被查,让给这些平台代言的明星名人们遭到千夫所指。大概直到这些明星被卷进去,他们也没完全弄懂什么是P2P。简而言之一句话,这年头给互联网金融做代言,很容易被卖了还帮人数钱。那么什么是P2P?从正规的解释讲,它是person-to-person的简写,意思是:个人对个人。
  • 【专利】 Searching system, method and P2P device for P2P device community

    作者:Hsin-Tai Wu 年份:2015
    摘要: A searching system, searching method and P2P devices for a P2P device community are provided. An online server connects to a content management server and a P2P device community, respectively. The content management server includes a search engine and an index database, and each of the P2P devices of the P2P device community is provided with an indexed data and a weighted data. The index database is recorded with the indexed data associated with each of the P2P devices of the P2P device community, and the search engine searches the index database to generate a search result and then generates a weighted and sorted search result based on the weighted data, thereby achieving the object of searching important file data in the P2P device community.
  • 【期刊】 A privacy data leakage prevention method in P2P networks

    刊名:Peer-to-Peer Networking and Applications 作者:Chae, Cheol-Joo ; Shin, YongJu ; Choi, Kiseok ; Kim, Ki-Bong ; Choi, Kwang-Nam 关键词:P2P ; P2P file sharing ; Privacy detection ; Privacy leakage prevention ; Privacy level 机构:Korea Institute of Science and Technology Information, 245 Daehangno, Yuseong-gu, Daejeon, Korea;Department of Computer Information, Daejeon Health Science College, 21 Chungjeong-ro, Dong-Gu, Daejeon, Korea; ; Korea Institute of Science and Technology Information, 245 Daehangno, Yuseong-gu, Daejeon, Korea;Department of Computer Information, Daejeon Health Science College, 21 Chungjeong-ro, Dong-Gu, Daejeon, Korea; 年份:2016
    摘要:Registered peers to a P2P service can share and exchange information with other peers without servers using P2P network. In such P2P networks, there are frequent leaks of the internal privacy data of an organization through P2P file sharing. Today, DLP which is a privacy data leakage prevention technology is applied P2P network blocking and file encryption methods. However restricting all the services and normal users is difficult due to the number of ports used by P2P including the port 80. Thus, we propose a privacy data leakage prevention method by releasing a P2P sharing file that does not include privacy data using a privacy data removing technology with a privacy data leaking risk factor. The proposed method provides higher security and performance compared with a DLP method as privacy data is removed from a P2P sharing file.
  • 【期刊】 A security monitoring method for malicious P2P event detection

    刊名:Peer-to-Peer Networking and Applications 作者:Jung, Hyun Mi ; Hwang, Il-Sun ; Moon, Jeong-Kyung ; Park, Hark- Soo 关键词:P2P ; Security monitoring system ; Virtual machine ; Malicious sharing file ; Behavior analysis 机构:Department of Advanced KREONET Security Service, Korea Institute of Science and Technology Information, 245 Daehangno, Yuseong, Daejeon, Korea;Division of IT Education, Sunmoon University, Kalsan-ri, Tangjaong-myaon, Asan-si, 336-708, Korea; ; Department of Advanced KREONET Security Service, Korea Institute of Science and Technology Information, 245 Daehangno, Yuseong, Daejeon, Korea;Division of IT Education, Sunmoon University, Kalsan-ri, Tangjaong-myaon, Asan-si, 336-708, Korea; 年份:2016
    摘要:Recently malicious code is spreading rapidly due to the use of P2P(peer to peer) file sharing. The malicious code distributed mostly transformed the infected PC as a botnet for various attacks by attackers. This can take important information from the computer and cause a large-scale DDos attack. Therefore it is extremely important to detect and block the malicious code in early stage. However a centralized security monitoring system widely used today cannot detect a sharing file on a P2P network. In this paper, to compensate the defect, P2P file sharing events are obtained and the behavior is analyzed. Based on the analysis a malicious file detecting system is proposed and synchronized with a security monitoring system on a virtual machine. In application result, it has been detected such as botnet malware using P2P. It is improved by 12 % performance than existing security monitoring system. The proposed system can detect suspicious P2P sharing files that were not possible by an existing system. The characteristics can be applied for security monitoring to block and respond to the distribution of malicious code through P2P.
  • 【专利】 COORDINATION OF WI-FI P2P AND LTE DATA TRAFFIC

    摘要:For LTE cellular data and Wi-Fi P2P technology coexistence scenario, a user equipment can generate in-device coexistence (IDC) indication message to the base station for DRX-based IDC solution. LTE data scheduling is described by a set of DRX parameters, while Wi-Fi P2P data scheduling is described by Opportunistic Power Saving (OppoPS) and Notification of Absence (NoA) parameters. When generating the IDC indication message for Wi-Fi P2P group client (GC), the DRX parameters must be selected carefully to maximize efficiency. Even though Wi-Fi shares less time, with proper time alignment, its coexistence performance could be better. For Wi-Fi P2P group owner (GO) with IDC TDM scheduling constraints, OppoPS and NoA should be aligned with DRX parameters to achieve best performance.
  • 【期刊】 A Proximity-Aware Interest-Clustered P2P File Sharing System

    摘要:Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. Clustering peers by their physical proximity can also improve file query performance. However, few current works are able to cluster peers based on both peer interest and physical proximity. Although structured P2Ps provide higher file query efficiency than unstructured P2Ps, it is difficult to realize it due to their strictly defined topologies. In this work, we introduce a Proximity-Aware and Interest-clustered P2P file sharing System (PAIS) based on a structured P2P, which forms physically-close nodes into a cluster and further groups physically-close and common-interest nodes into a sub-cluster based on a hierarchical topology. PAIS uses an intelligent file replication algorithm to further enhance file query efficiency. It creates replicas of files that are frequently requested by a group of physically close nodes in their location. Moreover, PAIS enhances the intra-sub-cluster file searching through several approaches. First, it further classifies the interest of a sub-cluster to a number of sub-interests, and clusters common-sub-interest nodes into a group for file sharing. Second, PAIS builds an overlay for each group that connects lower capacity nodes to higher capacity nodes for distributed file querying while avoiding node overload. Third, to reduce file searching delay, PAIS uses proactive file information collection so that a file requester can know if its requested file is in its nearby nodes. Fourth, to reduce the overhead of the file information collection, PAIS uses bloom filter based file information collection and corresponding distributed file searching. Fifth, to improve the file sharing efficiency, PAIS ranks the bloom filter results in order. Sixth, considering that a recently visited file tends to be visited again, the bloom filter based appr- ach is enhanced by only checking the newly added bloom filter information to reduce file searching delay. Trace-driven experimental results from the real-world PlanetLab testbed demonstrate that PAIS dramatically reduces overhead and enhances the efficiency of file sharing with and without churn. Further, the experimental results show the high effectiveness of the intra-sub-cluster file searching approaches in improving file searching efficiency.
  • 【期刊】 Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce

    刊名:IEEE Transactions on Parallel and Distributed Systems 作者:Wang, Guojun ; Musau, Felix ; Guo, Song ; Abdullahi, Muhammad Bashir 关键词:P2P ; computer network security ; electronic commerce ; peer-to-peer computing ; trusted computing ; Internet ; P2P e-commerce ; Sybil attack ; active attack ; neighbor similarity trust ; passive attack ; peer-to-peer electronic commerce ; social networks ; trusted certification ; Admission control ; Business ; Educational institutions ; Peer-to-peer computing ; Routing ; Security ; Social network services ; Sybil attack ; collusion attack ; neighbor similarity ; trust 机构:Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; 年份:2015
    摘要:Peer to peer (P2P) e-commerce applications exist at the edge of the Internet with vulnerabilities to passive and active attacks. These attacks have pushed away potential business firms and individuals whose aim is to get the best benefit in e-commerce with minimal losses. The attacks occur during interactions between the trading peers as a transaction takes place. In this paper, we propose how to address Sybil attack, an active attack, in which peers can have bogus and multiple identities to fake their owns. Most existing work, which concentrates on social networks and trusted certification, has not been able to prevent Sybil attack peers from doing transactions. Our work exploits the neighbor similarity trust relationship to address Sybil attack. In our approach, duplicated Sybil attack peers can be identified as the neighbor peers become acquainted and hence more trusted to each other. Security and performance analysis shows that Sybil attack can be minimized by our proposed neighbor similarity trust.
  • 【期刊】 Enhanced Entropy-Based Resource Searching in Unstructured P2P Networks

    刊名:Chinese Journal of Electronics 作者:GONG Weihua ; JIN Rong ; YANG Lianghuai ; HUANG Decai 关键词:Peer-to-peer(P2P),Resource searching,Entropy,Query routing tree,Information gain 年份:2015
    摘要:How to find desired resources efficiently and accurately is one fundamental challenge of any unstructured P2 P networks, which is mainly involved some difficulties in the P2 P overlay topology, data representation in peers and routing mechanism. In this paper, we address the issue of resilient routing in unstructured P2 P networks. An efficient algorithm called Query routing tree(QRT) based on maximum mutual information is proposed to improve the performance of resource searching, which has tightly associated the resource contents of peers with the logical links in P2 P network that makes the query messages forwarded more effectively in similar peers and can hit more target resources faster. Additionally, we present an optimized routing scheme with the query conditions taken into account, to obtain the optimal routing tree with the minimal information gain from the candidate tree set so as to adapt to different query types more flexibly. The simulation results show the proposed QRT can reduce the search cost more effectively and maintain higher targets hit rate than existing typical algorithms such as Flooding, k-RW and APS. Finally, our optimized scheme is also proved to conduct high searching performance with nicer self-adaptability and scalability in unstructured P2 P networks.
  • 【期刊】 Fine-grained P2P traffic classification by simply counting flows

    刊名:Frontiers of Information Technology & Electronic Engineering 作者:Jie HE ; Yue-xiang YANG ; Yong QIAO ; Wen-ping DENG 关键词:Traffic classification,Peer-to-peer(P2P),Fine-grained,Host-based 年份:2015
    摘要:The continuous emerging of peer-to-peer(P2P) applications enriches resource sharing by networks, but it also brings about many challenges to network management. Therefore, P2 P applications monitoring, in particular,P2 P traffic classification, is becoming increasingly important. In this paper, we propose a novel approach for accurate P2 P traffic classification at a fine-grained level. Our approach relies only on counting some special flows that are appearing frequently and steadily in the traffic generated by specific P2 P applications. In contrast to existing methods, the main contribution of our approach can be summarized as the following two aspects. Firstly, it can achieve a high classification accuracy by exploiting only several generic properties of flows rather than complicated features and sophisticated techniques. Secondly, it can work well even if the classification target is running with other high bandwidth-consuming applications, outperforming most existing host-based approaches, which are incapable of dealing with this situation. We evaluated the performance of our approach on a real-world trace. Experimental results show that P2 P applications can be classified with a true positive rate higher than 97.22% and a false positive rate lower than 2.78%.
  • 【期刊】 Fine-grained P2P traffic classification by simply counting flows

    刊名:Frontiers of Information Technology & Electronic Engineering 作者: Jie 关键词:Traffic classification ; Peer-to-peer (P2P) ; Fine-grained ; Host-based 机构:College of Computer, National University of Defense Technology, Changsha, 410073, China;The Research Institution, China Electronic Equipment & System Engineering Company, Beijing, 100141, China; ; College of Computer, National University of Defense Technology, Changsha, 410073, China;The Research Institution, China Electronic Equipment & System Engineering Company, Beijing, 100141, China; 年份:2015
    摘要:The continuous emerging of peer-to-peer (P2P) applications enriches resource sharing by networks, but it also brings about many challenges to network management. Therefore, P2P applications monitoring, in particular, P2P traffic classification, is becoming increasingly important. In this paper, we propose a novel approach for accurate P2P traffic classification at a fine-grained level. Our approach relies only on counting some special flows that are appearing frequently and steadily in the traffic generated by specific P2P applications. In contrast to existing methods, the main contribution of our approach can be summarized as the following two aspects. Firstly, it can achieve a high classification accuracy by exploiting only several generic properties of flows rather than complicated features and sophisticated techniques. Secondly, it can work well even if the classification target is running with other high bandwidth-consuming applications, outperforming most existing host-based approaches, which are incapable of dealing with this situation. We evaluated the performance of our approach on a real-world trace. Experimental results show that P2P applications can be classified with a true positive rate higher than 97.22% and a false positive rate lower than 2.78%.
上一页 1 2 3 4 5 6 7 8 9 10 下一页 跳转