AToM: Active topology monitoring for the bitcoin peer-to-peer network

AbstractOver the past decade, the Bitcoin P2P network protocol has become a reference model for all modern cryptocurrencies. While nodes in this network are known, the connections among them are kept hidden, as it is commonly believed that this helps protect from deanonymization and low-level attacks. However, adversaries can bypass this limitation by inferring connections through side channels. At the same time, the lack of topology information hinders the analysis of the network, which is essential to improve efficiency and security. In this paper, we thoroughly review network-level attacks and empirically show that topology obfuscation is not an effective countermeasure. We then argue that the benefits of an open topology potentially outweigh its risks, and propose a protocol to reliably infer and monitor connections among reachable nodes of the Bitcoin network. We formally analyze our protocol and experimentally evaluate its accuracy in both trusted and untrusted settings. Results show our system has a low impact on the network, and has precision and recall are over 90% with up to 20% of malicious nodes in the network.

Download Full-text

Quality Assurance for Reusable Learning Objects on a Peer-To-Peer Network

International Journal of Emerging Technologies in Learning (iJET) ◽

10.3991/ijet.v11i10.5881 ◽

2016 ◽

Vol 11 (10) ◽

pp. 4 ◽

Cited By ~ 1

Author(s):

Rajendra G. Singh ◽

Margaret A. Bernard

Keyword(s):

Subject Matter ◽

Learning Objects ◽

Peer To Peer ◽

P2p Network ◽

Subject Matter Experts ◽

Reusable Learning Objects ◽

Peer Network ◽

First Time ◽

Peer To Peer Network

In this research, improving on the quality of Reusable Learning Objects (RLOs) on a Peer-To-Peer (P2P) network is considered. The RLO was first redesigned to have a fundamentally inherent pedagogical structure, which gave it an immediate foundational level of quality in terms of opportunities related to reusability. Applying the Learning Object Review Instrument 1.5 (LORI 1.5) demonstrated that some of the elements are inherent in this new RLO design, so there was no need to constantly have such features evaluated with LORI. A modified LORI was therefore developed in order to evaluate the remaining features of the RLO. The research identified these remaining elements to produce a Review Rubric for scoring the RLO’s quality. In addition, an algorithm is given which considers one or more subject-matter experts as part of a review process. Utilizing the subject-matter experts in a P2P network involved the creation of special nodes to ensure data integrity and post-availability of the review scores for RLOs. The research concludes that the redesigned RLOs along with the corresponding Review Rubric and scoring algorithm produces a system suitable for a P2P network, where for the first time, RLOs can be shared of assured quality to promote eLearning within P2P networks.

Download Full-text

Topology Construction Mechanism of Behavior-Controllable Hierarchical Military Peer to Peer Network

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.765-767.1254 ◽

2013 ◽

Vol 765-767 ◽

pp. 1254-1258

Author(s):

Ai Xia Zhou ◽

Lian Feng Gao ◽

Jing Feng ◽

Li Yu ◽

Xue Yan Zhang

Keyword(s):

Special Needs ◽

Network Topology ◽

Peer To Peer ◽

P2p Network ◽

Topology Construction ◽

Peer Network ◽

Military Applications ◽

New Construction ◽

Peer To Peer Network

In order to meet the special needs of military applications, network users were classified according to characteristics of users and a hierarchical behavior-controllable P2P network topology construction was designed. In the new construction, different information has different circulation range and the survivability and expansion characteristics of the P2P network were made full use.

Download Full-text

Study of Adaptive Routing Method in Peer-to-Peer Network

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.40-41.392 ◽

2010 ◽

Vol 40-41 ◽

pp. 392-397

Author(s):

Den Ming Fan ◽

Qi Zhu

Keyword(s):

Adaptive Routing ◽

Peer To Peer ◽

P2p Network ◽

Simulation Experiments ◽

Peer Network ◽

Routing Method ◽

Peer To Peer Network

This paper aim To analyze and discuss a Query-based Routing Method in P2P network (QRM) , In this algorithm,the node records the received query and the nodes that can answer the query very well,in these nodes, Simulation experiments demonstrate that the method can enhance the searching efficiency very well with the number of queries becoming more and more.

Download Full-text

Influence of Bottleneck Nodes on Malicious Packet Dropping Nodes Mitigation in Wireless Infrastructure-less Networks

International Journal For Innovative Engineering and Management Research ◽

10.48047/ijiemr/v10/i11/08 ◽

2021 ◽

pp. 50-53

Keyword(s):

Ad Hoc ◽

Peer To Peer ◽

Malicious Nodes ◽

Reliable Communication ◽

Malicious Behavior ◽

Peer Network ◽

Secure Protocols ◽

Hoc Networks ◽

Wireless Infrastructure ◽

Peer To Peer Network

Mobile ad hoc networks as an infrastructure free, and constrained resource environment network. The network aim is to establish internet connectivity everywhere regardless of location. The applications of network are healthcare, disaster relief and military, where reliable communication is major concern. Communication in the network is initiated by establishing the communication route between source and destination and sending the information through it. One of the characteristics of MANETs is a peer-to-peer network, where intermediate nodes have to cooperate for reliable communication by acting as routers. In literature number of routing protocols have been designed based on the MANET’s peer to peer characteristic. However, it may not be every time true that the intermediate nodes act as faithful routers, and they may untrustworthy either due to malicious behavior or bottleneck. Number of secure protocols have been designed to mitigate malicious behavior by neglecting the bottleneck. The paper aims to define the bottleneck, and its importance in communication. Finally, how bottleneck influence on the MANETs performance during malicious nodes mitigation

Download Full-text

A Sybil-Resilient Peer-to-Peer Network Protocol

2009 International Conference on Web Information Systems and Mining ◽

10.1109/wism.2009.141 ◽

2009 ◽

Author(s):

Xu Xiang ◽

Zhou Hangxia

Keyword(s):

Peer To Peer ◽

Network Protocol ◽

Peer Network ◽

Peer To Peer Network

Download Full-text

Peer-to-Peer Network-Based Image Retrieval

Multimedia Networking and Coding ◽

10.4018/978-1-4666-2660-7.ch013 ◽

2013 ◽

pp. 377-399

Author(s):

Chun-Rong Su ◽

Jiann-Jone Chen

Keyword(s):

Image Retrieval ◽

Large Scale ◽

Recall Rate ◽

Peer To Peer ◽

P2p Network ◽

Peer Network ◽

The One ◽

Peer To Peer Network ◽

Query Model ◽

Query Scope

Performing Content-Based Image Retrieval (CBIR) in Internet connected databases through Peer-to-Peer (P2P) network (P2P-CBIR) helps to effectively explore the large-scale image database distributed over connected peers. Decentralized unstructured P2P framework is adopted in our system to compromise with the structured one while still reserving flexible routing control when peers join/leave or network fails. The P2P- CBIR search engine is designed to provide multi-instance query with multi-feature types to effectively reduce network traffic while maintaining high retrieval accuracy. In addition, the proposed P2P-CBIR system is also designed in the way to provide scalable retrieval function, which can adaptively control the query scope and progressively refine the accuracy of retrieved results. To reflect the most updated local database characteristics for the P2P-CBIR users, reconfiguring system at each regular interval time can effectively reduce trivial peer routing and retrieval operations due to imprecise configuration. Experiments demonstrated that the average recall rate of the proposedP2P-CBIR with reconfiguration is higher than the one without about 20%, and the latter outperforms previous methods, i.e., firework query model (FQM) and breadth-first search (BFS) about 20% and 120%, respectively, under the same range of TTL values.

Download Full-text