Bitcoin’ s anonymity greatly protects users’ privacy, but it also makes regulation difficult. In Bitcoin, a random number generates a public-private key pair, the public key generates an address, and the private key is used for digital signatures. Users can generate multiple pairs of public and private keys to trade with multiple bitcoin addresses. Discovering the relationships between these addresses and clustering the addresses of individual users helps infer the identity of the addresses. By analyzing the association of addresses in UTXO , it is found that multiple input addresses of a transaction are controlled by the same user, and thus the bitcoin addresses can be clustered. The transactions between the user data obtained after clustering are communality, so the Louvain algorithm is further used to analyze the relationship between users, the visual results are used to present the association between users, and the impact of the number of users on the algorithm results is analyzed. Finally, the Leiden algorithm proposed to solve the problem that Louvain algorithm may have poor connectivity or even disconnection between communities is used to discover the community of the clustered user data. Compare the results of Leiden algorithm and Louvain algorithm and analyze the difference between the two results.
Non-Fungible tokens (NFTs) are a special type of token that has a unique ID and can be held or traded as a crypto asset by Ethereum users. For the current NFT standard, NFT owner’s account address is stored in plaintext by blockchain. Once a user’s real identity and account address is known, his NFT holdings are also exposed. In practice, one may consider the NFT holdings to be private. In this paper, we propose the first solution to achieve anonymous NFT on Ethereum in a trustless environment. The owner address of an NFT will be hidden while the NFT can be continuously traded without revealing the addresses of buyers and sellers. Furthermore, we prove that our scheme preserves privacy against all entities in the trading system and builds an implementation to evaluate its performance. The result shows our solution is suitable for application.
Over the past few years, there has been a profound evolution in decentralization methodologies, owing largely to the emergence of novel decentralized technologies like blockchain. In the realm of online social media, a paradigm shift has been suggested with the introduction of blockchain-based online social media (BOSM), heralding a potential future for social media platforms wherein users are duly rewarded for their valuable contributions. Despite the widespread adoption of these platforms by millions of users, it is crucial to acknowledge that their decentralization remains incomplete. One prevailing issue within existing blockchain systems resides in the vulnerability of the Delegated Proof of Stake (DPoS) consensus algorithm, which is susceptible to manipulation by the few selected nodes. Anticipating the demands of the forthcoming generation of social media, the pivotal imperative lies in establishing decentralization as its foundational hallmark. In this paper, we present Sociala, an incentivized blockchain-based framework tailored for writers. To effectively address the pitfalls of centralization and minimize the likelihood of nefarious node selection, we proffer an enhanced multi-step DPoS consensus algorithm, which is referred as modified DPoS (mDPoS). This advanced algorithm embraces both the tenets of randomness and diversity, coupled with the inclusion of input from general users, culminating in fortified system stability.
The emergence of blockchain has ushered in a significant transformation in information systems research. Blockchain’s key pillars such as decentralization, immutability, and transparency have paved the path for extensive exploration in various research domains. This particular study is focused on electronic voting, aiming to improve voting procedures by making better use of the benefits offered by blockchain technology. Through a comprehensive review of existing literature, we highlight the potential benefits of blockchain-based electronic voting systems such as transparency, security, and efficiency. However, several challenges, such as scalability, personal data confidentiality, and ensuring robust identity verification, persist. Addressing these issues is necessary to unlock the full potential of blockchain-based electronic voting systems, thereby fostering the development of trustworthy election systems in the future.
Blockchain technology has emerged as a compelling field of study over the past decade. Nevertheless, certain blockchain-based protocols, particularly those reliant on permissioned blockchains, continue to be under the governance of a central authority (CA). This central authority possesses extensive control capabilities, including the facilitation of user network access, as well as the establishment, connection, and revocation of users to and from the network. Consequently, the majority of policies within these protocols are centrally administered by a singular party. This paper introduces an architectural framework and a specific protocol denoted as the ”Anonymous Reporting System with No Central Authority” (ARSnCA) on a public blockchain infrastructure. This design aims to mitigate the challenges posed by untrusted privileged insiders to the ARSnCA. It is hypothesized that this approach can enhance system reliability, fault tolerance, and foster trust among network members. To eliminate the central authority, a concept termed the virtual blockchain (VBC) is implemented as an embedded permissioned blockchain within a permissionless blockchain. Following the removal of the CA, the authorities previously held by the central authority are transferred to the members of the VBC. Comparative analysis and evaluation of the ARSnCA protocol demonstrate a performance advantage, with speeds that are 62% and 92% faster than reporting protocols based on ring signatures and other protocols included in the comparison.
Open access
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
Guocheng Zhu, Debiao He, Haoyang An, Min Luo · 5 authors
Abstract After the Ethereum DAO attack in 2016, which resulted in significant economic losses, blockchain governance has become a prominent research area. However, there is a lack of comprehensive and systematic literature review on blockchain governance. To deeply understand the process of blockchain governance and provide guidance for the future design of the blockchain governance model, we provide an in-depth review of blockchain governance. In this paper, first we introduce the consensus algorithms currently used in blockchain and relate them to governance theory. Second, we present the main content of off-chain governance and investigate two well-known off-chain governance projects. Third, we investigate four common on-chain governance voting techniques, then summarize the seven attributes that the on-chain governance voting process should meet, and finally analyze four well-known on-chain governance blockchain projects based on the previous research. We hope this survey will provide an in-depth insight into the potential development direction of blockchain governance and device future research agenda.
Bitcoin was launched over a decade ago and has made an increasing impact on the world’s financial order, which has attracted the attention of researchers all over the world. The Bitcoin system runs on a dynamic P2P network, containing tens of thousands of nodes, including reachable nodes and unreachable nodes. In this article, a detection system, BNS (Bitcoin Network Sniffer), which could collect as many Bitcoin nodes as possible is proposed. For reachable nodes, the authors designed an algorithm, BRF (Bitcoin Reachable-Nodes Finding), based on node activity evaluation which reduces the nodes to be detected and greatly shortens the detection time. For unreachable nodes, the authors trained a decision tree model, BUF (Bitcoin Unreachable-Nodes Finding), to identify unreachable nodes based on attribute features from a large number of node addresses. Experiments showed that BNS discovered an average of 1093 more reachable nodes (6.4%) and 662 more unreachable nodes (2.3%) than the well-known website “Bitnodes” per day. It showed better performance in total nodes and efficiency. Based on the experimental results, the authors analyzed the real network size, node “churn”, and geographical distribution.
Phishing scams have become the most serious type of crime involved in Ethereum. However, existing methods ignore the natural camouflage and sparse distribution of phishing scams in Ethereum leading to unsatisfactory performance, and they are also limited by the data scale which cannot be applied to real-world dynamic scenarios. In this paper, we propose a Transaction Graph Contrast network (TGC) to enhance phishing scam detection performance on Ethereum. TGC inputs subgraphs instead of the entire graph for training, which eases the model’s requirements for machine configuration and data connectivity. Motivated by phishing nodes are surrounded by normal nodes, we design the comparison between node-level to help phishing nodes learn the unique properties of themselves different from their neighbors. Observing the small number and sparse distribution of phishing nodes, we narrow the distance between phishing nodes by comparing node context-level structures, so as to learn universal transaction patterns. We further combine the obtained features with common statistics to identify phishing addresses. Evaluated on real-world Ethereum phishing scams datasets, our TGC outperforms the state-of-the-art methods in detecting phishing addresses and has obvious advantages in large-scale and dynamic scenarios.
Mansoor Ahmed Jumani, Du Yujie, Muhammad Owais Khan
A key component of democratic governance in modern countries is the election process. But due to worries about things like polling booth capturing, data manipulation, and vote rigging, a general mistrust in the electoral process has evolved. Because they put election data under the authority of outside organizations, both the traditional and computerized voting systems now in use lack the required transparency. Voters have few options to verify that election administrators will carefully and accurately count their votes due to a lack of openness. To create an electronic voting (e-voting) system that upholds the ideals of fairness and security, it is imperative to take advantage of developing technology, particularly blockchain. When correctly applied, blockchain technology's public distributed ledger holds the potential to make tampering almost impossible. In this regard, our research suggests a decentralized electronic voting system that makes use of blockchain technology as a remedy to deal with the aforementioned issues. Through the elimination of the possibility of centralized election control, this approach seeks to reduce the dangers connected with conventional election procedures and increase voter confidence. The suggested method offers a tamper-proof, transparent, verifiable, economical, and reliable voting process through the distribution of control across several governing and non-governing bodies. This paper examines the development and implementation of such a blockchain-based electronic voting system, shedding insight on how it may enhance the openness and accessibility of democratic elections in contemporary societies.
Leon Witt, Usama Zafar, KuoYeh Shen, Felix Sattler · 7 authors
Federated Learning (FL) has emerged as a powerful paradigm in Artificial Intelligence, facilitating the parallel training of Artificial Neural Networks on edge devices while safeguarding data privacy. Nonetheless, to encourage widespread adoption, Federated Learning Frameworks (FLFs) must tackle (i) the power imbalance between a central authority and its participants, and (ii) the challenge of equitably measuring and incentivizing contributions. Existing approaches to decentralize and incentivize FL processes are hindered by (i) computational overhead and (ii) uncertainty in contribution assessment [1]), limiting FL's scalability beyond use cases where trust between participants and the server is established. This work introduces a cutting-edge, blockchain-enabled federated learning framework that incorporates Federated Knowledge Distillation (FD) with compressed 1-bit soft-labels, aggregated through a smart contract. Furthermore, we present the Peer Truth Serum for Federated Distillation (PTSFD), which cultivates an incentive-compatible ecosystem by rewarding honest participation based on an implicit yet effective comparison of worker contributions. The primary innovation stems from its lightweight architecture that simultaneously promotes decentralization and incentivization, addressing critical challenges in contemporary FL approaches.
Blockchain-empowered federated learning (FL) has provoked extensive research recently. Various blockchain-based federated learning algorithm, architecture and mechanism have been designed to solve issues like single point failure and data falsification brought by centralized FL paradigm. Moreover, it is easier to allocate incentives to nodes with the help of the blockchain. Various centralized federated learning frameworks like FedML, have emerged in the community to help boost the research on FL. However, decentralized blockchain-based federated learning framework is still missing, which cause inconvenience for researcher to reproduce or verify the algorithm performance based on blockchain. Inspired by the above issues, we have designed and developed a blockchain-based federated learning framework by embedding Ethereum network. This report will present the overall structure of this framework, which proposes a code practice paradigm for the combination of FL with blockchain and, at the same time, compatible with normal FL training task. In addition to implement some blockchain federated learning algorithms on smart contract to help execute a FL training, we also propose a model ownership authentication architecture based on blockchain and model watermarking to protect the intellectual property rights of models. These mechanism on blockchain shows an underlying support of blockchain for federated learning to provide a verifiable training, aggregation and incentive distribution procedure and thus we named this framework VeryFL (A Verify Federated Learninig Framework Embedded with Blockchain). The source code is avaliable on https://github.com/GTMLLab/VeryFL.
Bitcoin has been launched for over a decade and made an increasing impact on the world’s financial order, which attracted extensive attention of researchers. Bitcoin system runs on a dynamic P2P network, containing tens of thousands of nodes including reachable nodes and unreachable nodes. In this article, a detection system BNS (Bitcoin Network Sniffer) was prososed, which could collect as many Bitcoin nodes as possible. For reachable nodes, the authors designed an algorithm BRF (Bitcoin Reachable-nodes Finding) based on node activity evaluation, which reduced the nodes to be detected and greatly shortened the detection time. For unreachable nodes, the authors trained a dicision tree model BUF(Bitcoin Unreachable-nodes Finding) to identify unreachable nodes based on attribute features from massive node addresses. Experiments showed that BNS performed better than the website "Bitnodes" in total number and efficiency. Based on the experimental results, the authors analyzed the real network size, node "churn" and geographical distribution.
This research delves into the intricacies of Bitcoin, a decentralized peer-to-peer network, and its associated blockchain, which records all transactions since its inception. While this ensures integrity and transparency, the transparent nature of Bitcoin potentially compromises users' privacy rights. To address this concern, users have adopted CoinJoin, a method that amalgamates multiple transaction intents into a single, larger transaction to bolster transactional privacy. This process complicates individual transaction tracing and disrupts many established blockchain analysis heuristics. Despite its significance, limited research has been conducted on identifying CoinJoin transactions. Particularly noteworthy are varied CoinJoin implementations such as JoinMarket, Wasabi, and Whirlpool, each presenting distinct challenges due to their unique transaction structures. This study delves deeply into the open-source implementations of these protocols, aiming to develop refined heuristics for identifying their transactions on the blockchain. Our exhaustive analysis covers transactions up to block 760,000, offering a comprehensive insight into CoinJoin transactions and their implications for Bitcoin blockchain analysis.
Md. Rahat Hasan, Ammar Alazab, Siddhartha Barman Joy, Mohammed Nasir Uddin · 9 authors
The Internet of Things (IoT) has recently attracted much interest from researchers due to its diverse IoT applications. However, IoT systems encounter additional security and privacy threats. Developing an efficient IoT system is challenging because of its sophisticated network topology. Effective access control is required to ensure user privacy in the Internet of Things. Traditional access control methods are inappropriate for IoT systems because most conventional access control approaches are designed for centralized systems. This paper proposes a decentralized access control framework based on smart contracts with three parts: initialization, an access control protocol, and an inspection. Smart contracts are used in the proposed framework to store access control policies safely on the blockchain. The framework also penalizes users for attempting unauthorized access to the IoT resources. The smart contract was developed using Remix and deployed on the Ropsten Ethereum testnet. We analyze the performance of the smart contract-based access policies based on the gas consumption of blockchain transactions. Further, we analyze the system’s security, usability, scalability, and interoperability performance.
Abstract The proliferation of IoT devices has influenced end users in several aspects. Yottabytes (YB) of information are being produced in the IoT environs because of the ever-increasing utilization capacity of the Internet. Since sensitive information, as well as privacy problems, always seem to be an unsolved problem, even with best-in-class in-formation governance standards, it is difficult to bolster defensive security capabilities. Secure data sharing across disparate systems is made possible by blockchain technology, which operates on a decentralized computing paradigm. In the ever-changing IoT environments, blockchain technology provides irreversibility (immutability) usage across a wide range of services and use cases. Therefore, blockchain technology can be leveraged to securely hold private information, even in the dynamicity context of the IoT. However, as the rate of change in IoT networks accelerates, every potential weak point in the system is exposed, making it more challenging to keep sensitive data se-cure. In this study, we adopted a Multi-level Blockchain-based Secured Framework (M-BSF) to provide multi-level protection for sensitive data in the face of threats to IoT-based networking systems. The envisioned M-BSF framework incorporates edge-level, fog-level, and cloud-level security. At edge- and fog-level security, baby kyber and scaling kyber cryptosystems are applied to ensure data preservation. Kyber is a cryptosystem scheme that adopts public-key encryption and private-key decryption processes. Each block of the blockchain uses the cloud-based Argon-2di hashing method for cloud-level data storage, providing the highest level of confidentiality. Argon-2di is a stable hashing algorithm that uses a hybrid approach to access the memory that relied on dependent and independent memory features. Based on the attack-resistant rate (> 96%), computational cost (in time), and other main metrics, the proposed M-BSF security architecture appears to be an acceptable alternative to the current methodologies.
Payment channel hubs (PCHs) serve as a promising solution to achieving quick off-chain payments between pairs of users. They work by using an untrusted tumbler to relay the payments between the payer and payee and enjoy the advantages of low cost and high scalability. However, the most recent privacy-preserving payment channel hub solution that supports variable payment amounts suffers from limited unlinkability, e.g., being vulnerable to the abort attack. Moreover, this solution utilizes zero-knowledge proofs, which bring huge costs on both computation time and communication overhead. Therefore, how to design PCHs that support variable amount payments and unlinkability, but reduce the use of huge-cost cryptographic tools as much as possible, is significant for the large-scale practical applications of off-chain payments.
Open access
Blockchain Technology Applications and Security
Internet Traffic Analysis and Secure E-voting
Advanced Steganography and Watermarking Techniques
Several countries have been researching digital voting methods in order to overcome the challenges of paper balloting and physical voting. The recent coronavirus disease 2019 (COVID-19) epidemic has compelled the remote implementation of existing systems and procedures. Online voting will ultimately become the norm just like unified payments interface (UPI) payments and online banking. With digital voting or electronic voting (e-voting) a small bug can cause massive vote rigging. E-voting must be honest, exact, safe, and simple. E-voting is vulnerable to malware, which can disrupt servers. Blockchain’s end-to-end validation solves these problems. Three smart contracts-voter, candidate, and voting-are employed. The problem of fraudulent actions is addressed using vote coins. Vote coins indicate voter status. Sidechain technology complements blockchain. Sidechains improve blockchain functionality by performing operations outside of blockchains and delivering the results to the mainchain. Thus, storing the encrypted vote on the sidechain and using the decrypted result on the mainchain reduces cost. Building access control policies to grant only authorized users’ access to the votes for counting is made simpler by this authorization paradigm. Results of the approach depict the proposed e-voting system improves system security against replay attacks and reduces the processing cost as well as processing time.
Open access
Internet Traffic Analysis and Secure E-voting
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
A pivotal feature of IPv6 is its plug-and-play capability that enables hosts to integrate seamlessly into networks. In the absence of a trusted authority or security infrastructure, the challenge for hosts is generating their own address and verifying ownership of others. Cryptographically Generated Addresses (CGA) solves this problem by binding IPv6 addresses to hosts' public keys to prove address ownership. CGA generation involves solving a cryptographic puzzle similar to Bitcoin's Proof-of-Work (PoW) to deter address spoofing. Unfortunately, solving the puzzle often causes undesirable address generation delays, which has hindered the adoption of CGA. In this paper, we present Bitcoin-Certified Addresses (BCA), a new technique to bind IPv6 addresses to hosts' public keys. BCA reduces the computational cost of generating addresses by using the PoW computed by Bitcoin nodes to secure the binding. Compared to CGA, BCA provides better protection against spoofing attacks and improves the privacy of hosts. Due to the decentralized nature of the Bitcoin network, BCA avoids reliance on a trusted authority, similar to CGA. BCA shows how the PoW computed by Bitcoin nodes can be reused, which saves costs for hosts and makes Bitcoin mining more efficient.
Yang Liu, Zhiyuan Lin, Yuxi Zhang, Lin Jiang · 5 authors
Ethereum, currently the most widely utilized smart contracts platform, anchors the security of myriad smart contracts upon its own robustness. Its foundational peer-to-peer network facilitates a dependable node connection mechanism, whereas an efficient data-sharing protocol constitutes as the bedrock of Blockchain network security. In this paper, we propose NodeHunter, an Ethereum network detector implemented through the application of simulation technology, which is capable of aggregating all node records within the network and the interconnectedness between them. Utilizing this connection information, NodeHunter can procure more comprehensive insights for network status analysis compared to preceding detection methodologies. Throughout a three-month period of unbroken surveillance of the Ethereum network, we obtained an excess of two million node records along with over one hundred million node acquaintances. Analysis of the gathered data revealed that an alarming 49% or more of these node records were maliciously forged.
The application of blockchain technology in electronic voting (e-voting) systems represents a promising solution to the perennial challenges of trust, transparency, and security in electoral processes. This study aims to identify a suitable blockchain protocol that supports trustworthy vote aggregation and has a suitable consensus algorithm to validate vote counting. Our research methodology includes an extensive literature review and a comparative analysis of different blockchain protocols. Considering this, we examine various consensus algorithms such as Proof of Work, Proof of Stake, and Practical Byzantine Fault Tolerance among others, each of which presents unique strengths and challenges. In addition, this study enriches the existing body of knowledge by proposing a novel algorithm that works at the edge of the network to validate and aggregate votes on the blockchain. This newly proposed algorithm is designed to provide maximum security, reliability, and accuracy while minimizing computational resources and network overhead. Our comprehensive research and innovative proposal serve to strengthen the potential of blockchain protocols and their consensus algorithms in the field of electronic voting systems. The results of this research could significantly influence the development and implementation of secure, transparent, and reliable e-voting systems based on blockchain technology, paving the way for more democratic and accountable voting mechanisms.
Blockchain based E-voting system can be revolution- ary in terms of security and tamper proof, transparent elections and hence empower the democracy. Blockchain E-voting is already implemented at organisational level. But at state/national level it faces challenges such as privacy, stability, latency etc. To counter them we require advanced implementation techniques from multiple disciplines. These techniques are 2-layer-solution, sharding for scalability issue, optimizing consensus algorithm and off-chain transaction for reducing latency, zero knowledge proof, using multiple protocols for user privacy etc. General architecture of blockchain is explained in details which combines election creation, voter registration, voter transaction, tallying the results and vote verification. We have discussed how integrating E-voting with blockchain document verification system can be benificial. It is complicated to implement at state, national level and need additional research and implementation to make blockchain E- voting acceptable in elections across the world. Through research and innovation we can make blockchain voting mainstream.
Open access
Internet Traffic Analysis and Secure E-voting
Network Traffic and Congestion Control
Advanced Steganography and Watermarking Techniques
Salem S. M. Khalifa, Ali Mohamed E. Ejmaa, Abdulmawla Mohammad Ali Najih, Mohamed Abd Arahman Masoud Zneen
A transition to democratic rule is considered the first step down a long road towards Libya’s recovery and prosperity. Thus, it strives to improve the country’s elections by introducing new technologies. A blockchain is a distributed ledger that is characterised by independence and security. Therefore, it has been widely applied in various fields ranging from credit encryption and digital currency. With the development of internet technology, electronic voting (E-voting) systems have been greatly popularised. However, they suffer from various security threats, which create a sense of distrust among existing systems. Integrating blockchain with online elections is a promising trend, which could lead to make an election transparent, immutable, reliable, and more secure. In this paper, we present a literature review and a case analysis of blockchain technology. Moreover, a framework for an E-voting system based on blockchain is proposed. The methodology is adopted on the basis of three activities, they are identification of the relevant literature about E-voting, system modelling, and the determination of suitable technological tools. The framework is secure and reliable. Thus, it could help increase the number of voters and ensure a high level of participation, as well as facilitate free and fair electoral processes
Delegated-Proof-of-Stake (DPoS) blockchains, such as EOSIO, Steem and TRON, are governed by a committee of block producers elected via a coin-based voting system. We recently witnessed the first de facto blockchain takeover that happened between Steem and TRON. Within one hour of this incident, TRON founder took over the entire Steem committee, forcing the original Steem community to leave the blockchain that they maintained for years. This is a historical event in the evolution of blockchains and Web 3.0. Despite its significant disruptive impact, little is known about how vulnerable DPoS blockchains are in general to takeovers and the ways in which we can improve their resistance to takeovers. In this paper, we demonstrate that the resistance of a DPoS blockchain to takeovers is governed by both the theoretical design and the actual use of its underlying coin-based voting governance system. When voters actively cooperate to resist potential takeovers, our theoretical analysis reveals that the current active resistance of DPoS blockchains is far below the theoretical upper bound. However in practice, voter preferences could be significantly different. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON. Our study identifies the diversity in voter preferences and characterizes the impact of this diversity on takeover resistance. Through both theoretical and empirical analyses, our study provides novel insights into the security of coin-based voting governance and suggests potential ways to improve the takeover resistance of any blockchain that implements this governance model.