Jingxin Zhu, Yao Sun, Lei Zhang, Bin Cao · 6 authors
Blockchain-enabled wireless network has been recognized as an emerging network architecture to be widely employed into the Internet of Things (IoT) ecosystems for establishing trust and consensus mechanisms without the involvement of a third party. However, the uncertainty and vulnerability of wireless channels among the IoT nodes may pose a serious challenge to facilitate the deployment of blockchain in wireless networks. In this paper, we first present a generic system model for blockchain enabled wireless networks with multiple communication connections, where the number of communication connections between a client IoT node and the blockchain full nodes can be any arbitrary positive integer to satisfy different security requirements. Based on the proposed spatial-temporal network model, we theoretically calculate the transmission successful probability and the required communication throughput to support a wireless blockchain network. Finally, simulation results validate the accuracy of our theoretical analysis.
Secure message dissemination is an important requirement of intelligent transportation systems (ITS). Existing solutions, such as broadcasting, are effective in flooding a message to a wider area, however, they are inherently unreliable and bandwidth inefficient. Furthermore, it is difficult to both assess the authenticity of a message and maintain the privacy of sender in a single solution. Moreover, as a practical solution, there is a need of economic modeling to incentivise vehicles for safe driving and cooperation. This paper proposes a blockchain based message dissemination approach which utilises incentive distribution and reputation management to overcome these challenges. Specifically, with the proposed voting based consensus algorithm, it can assess the authenticity of a message and select the most suitable relay node for its dissemination in a completely decentralised fashion. Meanwhile, the blockchain based integrated incentive and reputation scheme encourages the cooperation among vehicles and strengthens its ability to deliver authentic messages. The security capacity of the proposed solution is demonstrated by a game theoretic analysis. Simulation results show that the proposed approach can save average consensus time by 11% and improve success rate of authentic message dissemination by 17% with less number of hops as compared to the existing solutions.
Abstract Blockchain technology and Internet of Things technology are two new technologies formed in the current transmission of information technology. In the implementation of its technical control, it can scientifically control the information sharing work and realize the artificial adjustment of the transmission control of the Internet of Things technology. In this paper, research on the Internet of Things data sharing model based on block chain with a view to provide guidance to the security of Things data sharing technology under the block chain. In this paper, Hyperledger Fabric block chain platform-based platform, proposed a block-based chain of IOT data sharing model, security and data privacy is an enhancement, obtained by the performance of the test model. Throughput is maximized when the write transaction sending frequency is 100 TPS and the query transaction sending frequency is 250 TPS. The maximum write throughput is 60 TPS, which is better than Bitcoin and Ethereum on the public chain, which proves the feasibility of the model implementation. This model can achieve storage and sharing without the help of a third-party centralized organization, and directly establish trust between participants, which can ensure the safe sharing of data.
Weikang Liu, Bin Cao, Lei Zhang, Mugen Peng · 5 authors
Keeping patients' sensitive information secured and untampered in the e-Health system is of paramount importance. Emerging as a promising technology to build a secure and reliable distributed ledger, blockchain can protect data from being falsified, which has attracted much attention from both academia and industry. However, with limited computational resources, medical IoT devices do not have efficient ability to fulfill the functionalities as a full node in wireless blockchain network (WBN). Facing this dilemma, Mobile Edge Computing (MEC) brings us dawn and hope through offloading the high resource demanding blockchain functionalities at the IoT devices to the MEC. However, aiming to maximize the mining profit, most of existing offloading strategies have ignored the other needs of wireless devices, e.g., faster transaction writing. In this paper, according to different needs, blockchain nodes are firstly divided into two categories. One is blockchain users whose needs are faster transaction uploading, the other is blockchain miners whose goals are maximum revenue. Then, to maximize both the utilities of blockchain users and blockchain miners, a Stackelberg game is introduced to formulate the interaction between them. From the simulation results, this game is proved to converge to a unique optimal equilibrium.
Abstract: Because of its accessibility and ease of use, cloud storage has become the most widely used type of storage on the market in recent years. However, the privacy and data security of cloud storage are at risk. The protection of data security and privacy is the main topic of this essay. We suggest a blockchain-based decentralised storage system. Since blockchain is a distributed peer-to-peer system, any processing node connected to the internet can join and build peers' networks, maximising resource usage. Blockchain protects data security. The user's file is encrypted and shared among a number of network peers in the proposed system utilising the IPFS (Interplanetary File System) protocol. Hashes are generated by IPFS. The path of the file is indicated by the hash value, which is kept on the blockchain. This project is focused on decentralised secure data storage, high data availability, and effective storage resource usage.
With the development of precise positioning technology, a growing number of location-based services (LBSs) facilitate people's life. Most LBSs require proof of location (PoL) to prove that the user satisfies the service requirement, which exposes the user's privacy. In this paper, we propose a zero-knowledge proof of location (zk-PoL) protocol to better protect the user's privacy. With the zk-PoL protocol, the user can choose necessary information to expose to the server, so that hierarchical privacy protection can be achieved. The evaluation shows that the zk-PoL has excellent security to resist main attacks, moreover the computational efficiency is independent of input parameters and the zk-PoL is appropriate to delay-tolerant LBSs.
Ferenc Béres, István András Seres, András A. Benczúr, Mikerah Quintyne-Collins
Ethereum is the largest public blockchain by usage. It applies an account-based model, which is inferior to Bitcoin's unspent transaction output model from a privacy perspective. Due to its privacy shortcomings, recently several privacy-enhancing overlays have been deployed on Ethereum, such as non-custodial, trustless coin mixers and confidential transactions. In our privacy analysis of Ethereum's account-based model, we describe several patterns that characterize only a limited set of users and successfully apply these quasi-identifiers in address deanonymization tasks. Using Ethereum Name Service identifiers as ground truth information, we quantitatively compare algorithms in recent branch of machine learning, the so-called graph representation learning, as well as time-of-day activity and transaction fee based user profiling techniques. As an application, we rigorously assess the privacy guarantees of the Tornado Cash coin mixer by discovering strong heuristics to link the mixing parties. To the best of our knowledge, we are the first to propose and implement Ethereum user profiling techniques based on quasi-identifiers. Finally, we describe a malicious value-fingerprinting attack, a variant of the Danaan-gift attack, applicable for the confidential transaction overlays on Ethereum. By incorporating user activity statistics from our data set, we estimate the success probability of such an attack.
This paper describes techniques to help with COVID-19 automated contact tracing, and with the restoration efforts. We describe a decentralized protocol for ``proof-of-contact'' in zero knowledge where a person can publish a short cryptographic proof attesting to the fact that they have been infected and that they have come in contact with a set of people without revealing any information about any of the people involved. More importantly, we describe how to compose these proofs to support broader functionality such as proofs of $n$th-order exposure which can further speed up automated contact tracing. The cryptographic proofs are publicly verifiable, and places the burden on the person proving contact and not on third parties or healthcare providers rendering the system more decentralized, and accordingly more scalable.
Due to the rapid development of the internet of Things (ioT), a massive number of devices are connected to the internet. For these distributed devices in ioT networks, how to ensure their security and privacy becomes a significant challenge. Blockchain technology provides a promising solution to protect the data integrity, provenance, privacy, and consistency for ioT networks. in blockchains, communication is a prerequisite for participants, which are distributed in the system, to reach consensus. However, in ioT networks, most of the devices communicate through wireless links, which are not always reliable. Hence, the communication reliability of ioT devices influences the system security. in this article, we rethink the roles of communication and computing in blockchains by accounting for communication reliability. We analyze the trade-off between communication reliability and computing power in blockchain security, and present a lower bound to the computing power that is needed to conduct an attack with a given communication reliability. Simulation results show that adversarial nodes can succeed in tampering with a block with less computing power by hindering the propagation of blocks from other nodes.
Meerja vali Shaik, Ch. Rupa, Rohith Gadde, M N S Koundinya · 5 authors
Nowadays everything seems to be original and it's being herculean task to identify which is not real. It may be a currency for people or valued currency for students such as certificates. A lot of fraudulent parties have made money by encouraging the duplicate certificates in society. As a result, low talented or inefficient people are getting more and they are being responsible for the degradation of any nation’s value. A blockchain-based certificate is a prime solution for the above problem. In this work, would like to discuss the functioning of a smart contract in favor of Issuing, verifying, and revoking the certificates through gas value[9] deductions. Thus our certificate can provide the added assurances of evidence of origin in a transparent manner using.
Yi Liu, Jialiang Peng, Jiawen Kang, Abdullah M. Iliyasu · 6 authors
Federated learning (FL) has recently been proposed as an emerging paradigm to build machine learning models using distributed training datasets that are locally stored and maintained on different devices in 5G networks while providing privacy preservation for participants. In FL, the central aggregator accumulates local updates uploaded by participants to update a global model. However, there are two critical security threats: poisoning and membership inference attacks. These attacks may be carried out by malicious or unreliable participants, resulting in the construction failure of global models or privacy leakage of FL models. Therefore, it is crucial for FL to develop security means of defense. In this article, we propose a blockchain-based secure FL framework to create smart contracts and prevent malicious or unreliable participants from being involved in FL. In doing so, the central aggregator recognizes malicious and unreliable participants by automatically executing smart contracts to defend against poisoning attacks. Further, we use local differential privacy techniques to prevent membership inference attacks. Numerical results suggest that the proposed framework can effectively deter poisoning and membership inference attacks, thereby improving the security of FL in 5G networks.
Internet of Things (IoT) is a set of technologies that enable network-connected devices to perform an action or share data among several connected devices or to a shared database. The actions can be anything from switching on an Air Conditioning device remotely to turning on the ignition of a car through a command issued from a remote location or asking Alexa or Google Assistant to search for weather conditions in an area. IoT has proved to be game-changing for many industries such as Supply Chain, Shipping and Transportation providing updates on the status of shipments in real time. This has resulted in a huge amount of data created by a lot of these devices all of which need to be processed in real time. In this thesis, we propose a method to collect sensor data from IoT devices and use blockchain to store and retrieve the collected data in a secure and decentralized fashion within a closed system, suitable for a single enterprise or a group of companies in industries like shipping where sharing data with each other is required. Much like blockchain, we envision a future where IoT devices can connect and disconnect to distributed systems without causing downtime for the data collection or storage or relying on a cloud-based storage system for synchronizing data between devices. We also look at how the performance of some of these distributed systems like Inter Planetary File System (IPFS) and Ethereum Swarm compare on low-powered devices like the raspberry pi.
Over the years, the flourish of crowd computing has enabled enterprises to accomplish computing tasks through crowdsourcing in a large-scale and high-quality manner, and therefore how to efficiently and securely implement crowd computing becomes a hotspot. Some recent work innovatively adopted a P2P (peer-to-peer) network as the communication environment of crowdsourcing. Based on its decentralized control, issues like single-point-of-failure or DDoS attack can be overcome to some extent, but the huge computing capacity and storage costs required by this scheme is always unbearable. Federated learning is a distributed machine learning that supports local storage of data, and clients implement training through interactive gradient values. In our work, we combine blockchain with federated learning and propose a crowdsourcing framework named CrowdSFL, that users can implement crowdsourcing with less overhead and higher security. In addition, to protect the privacy of participants, we design a new re-encryption algorithm based on Elgamal to ensure that interactive values and other information will not be exposed to other participants outside the workflow. Finally, we have proved through experiments that our framework is superior to some similar work in accuracy, efficiency, and overhead.
Alexandros Bampoulidis, A. Bruni, Lukas Helminger, Daniel Kales · 6 authors
Recent work has shown that cell phone mobility data has the unique potential to create accurate models for human mobility and consequently the spread of infected diseases [74]. While prior studies have exclusively relied on a mobile network operator’s subscribers’ aggregated data in modelling disease dynamics, it may be preferable to contemplate aggregated mobility data of infected individuals only. Clearly, naively linking mobile phone data with health records would violate privacy by either allowing to track mobility patterns of infected individuals, leak information on who is infected, or both. This work aims to develop a solution that reports the aggregated mobile phone location data of infected individuals while still maintaining compliance with privacy expectations. To achieve privacy, we use homomorphic encryption, validation techniques derived from zero-knowledge proofs, and differential privacy. Our protocol’s open-source implementation can process eight million subscribers in 70 minutes.
Purpose The purpose of this work is to bridge FL and blockchain technology through designing a blockchain-based smart agent system architecture and applying in FL. and blockchain technology through designing a blockchain-based smart agent system architecture and applying in FL. FL is an emerging collaborative machine learning technique that trains a model across multiple devices or servers holding private data samples without exchanging their data. The locally trained results are aggregated by a centralized server in a privacy-preserving way. However, there is an assumption where the centralized server is trustworthy, which is impractical. Fortunately, blockchain technology has opened a new era of data exchange among trustless strangers because of its decentralized architecture and cryptography-supported techniques. Design/methodology/approach In this study, the author proposes a novel design of a smart agent inspired by the smart contract concept. Specifically, based on the proposed smart agent, a fully decentralized, privacy-preserving and fair deep learning blockchain-FL framework is designed, where the agent network is consistent with the blockchain network and each smart agent is a participant in the FL task. During the whole training process, both the data and the model are not at the risk of leakage. Findings A demonstration of the proposed architecture is designed to train a neural network. Finally, the implementation of the proposed architecture is conducted in the Ethereum development, showing the effectiveness and applicability of the design. Originality/value The author aims to investigate the feasibility and practicality of linking the three areas together, namely, multi-agent system, FL and blockchain. A blockchain-FL framework, which is based on a smart agent system, has been proposed. The author has made several contributions to the state-of-the-art. First of all, a concrete design of a smart agent model is proposed, inspired by the smart contract concept in blockchain. The smart agent is autonomous and is able to disseminate, verify the information and execute the supported protocols. Based on the proposed smart agent model, a new architecture composed by these agents is formed, which is a blockchain network. Then, a fully decentralized, privacy-preserving and smart agent blockchain-FL framework has been proposed, where a smart agent acts as both a peer in a blockchain network and a participant in a FL task at the same time. Finally, a demonstration to train an artificial neural network is implemented to prove the effectiveness of the proposed framework.
Crowdworking platforms provide the opportunity for diverse workers to execute tasks for different requesters. The popularity of the ”gig” economy has given rise to independent platforms that provide competing and complementary services. Workers as well as requesters with specific tasks may need to work for or avail from the services of multiple platforms resulting in the rise of multi-platform crowdworking systems. Recently, there has been increasing interest by governmental, legal and social institutions to enforce regulations, such as minimal and maximal work hours, on crowdworking platforms. Platforms within multi-platform crowdworking systems, therefore, need to collaborate to enforce cross-platform regulations. While collaborating to enforce global regulations requires the transparent sharing of information about tasks and their participants, the privacy of all participants needs to be preserved. In this paper, we propose an overall vision exploring the regulation, privacy, and architecture dimensions for the future of work multi-platform crowdworking environments. We then present Separ, a multi-platform crowdworking system that enforces a large sub-space of practical global regulations on a set of distributed independent platforms in a privacy-preserving manner. Separ, enforces privacy using lightweight and anonymous tokens, while transparency is achieved using fault-tolerant blockchain ledgers shared among multiple platforms. The privacy guarantees of Separ against covert adversaries are formalized and thoroughly demonstrated, while the experiments reveal the efficiency of Separ in terms of performance and scalability.
May 1, 2020·2020 IEEE 6th Intl Conference on Big Data Security on Cloud (BigDataSecurity), IEEE Intl Conference on High Performance and Smart Computing, (HPSC) and IEEE Intl Conference on Intelligent Data and Security (IDS)
Data Protection regulations, like GDPR, mandate security controls to secure Personal Identifiable Information (PII) of the users which they share with service providers. With the volume of shared data reaching exascale proportions, it is challenging to ensure GDPR compliance in real time. We propose a novel approach that integrates GDPR Ontology with Blockchain to facilitate real time automated data compliance. Our framework ensures data operation is allowed only when validated by data privacy policies in compliance with privacy rules in GDPR. When a valid transaction takes place the PII data is automatically stored off-chain in a database. Our system, built using Semantic Web and Ethereum Blockchain, includes an access-control system that enforces data privacy policy when data is shared with third parties.
Benedikt Bünz, Lucianna Kiffer, Loi Luu, Mahdi Zamani
To validate transactions, cryptocurrencies such as Bitcoin and Ethereum require nodes to verify that a blockchain is valid. This entails downloading and verifying all blocks, taking hours and requiring gigabytes of bandwidth and storage. Hence, clients with limited resources cannot verify transactions independently without trusting full nodes. Bitcoin and Ethereum offer light clients known as simplified payment verification (SPV) clients, that can verify the chain by downloading only the block headers. Unfortunately, the storage and bandwidth requirements of SPV clients still increase linearly with the chain length. For example, as of July 2019, an SPV client in Ethereum needs to download and store about 4 GB of data.Recently, Kiayias et al. proposed a solution known as noninteractive proofs of proof-of-work (NIPoPoW) that allows a light client to download and store only a polylogarithmic number of block headers in expectation. Unfortunately, NIPoPoWs are succinct only as long as no adversary influences the honest chain, and can only be used in chains with fixed block difficulty, contrary to most cryptocurrencies which adjust block difficulty frequently according to the network hashrate.We introduce FlyClient, a novel transaction verification light client for chains of variable difficulty. FlyClient is efficient both asymptotically and practically and requires downloading only a logarithmic number of block headers while storing only a single block header between executions. Using an optimal probabilistic block sampling protocol and Merkle Mountain Range (MMR) commitments, FlyClient overcomes the limitations of NIPoPoWs and generates shorter proofs over all measured parameters. In Ethereum, FlyClient achieves a synchronization proof size of less than 500 KB which is roughly 6,600x smaller than SPV proofs. We finally discuss how FlyClient can be deployed with minimal changes to the existing cryptocurrencies via an uncontentious velvet fork.
Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, Edgar Weippl
A reliable source of randomness is not only an essential building block in various cryptographic, security, and distributed systems protocols, but also plays an integral part in the design of many new blockchain proposals. Consequently, the topic of publicly-verifiable, bias-resistant and unpredictable randomness has recently enjoyed increased attention. In particular random beacon protocols, aimed at continuous operation, can be a vital component for current Proof-of-Stake based distributed ledger proposals. We improve upon previous random beacon approaches with HydRand, a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values. Furthermore, HydRand provides guaranteed output delivery of randomness at regular and predictable intervals in the presence of adversarial behavior and does not rely on a trusted dealer for the initial setup. Compared to existing PVSS based approaches that strive to achieve similar properties, our solution improves scalability by lowering the communication complexity from $\mathcal{O}\left( {{n^3}} \right)$ to $\mathcal{O}\left( {{n^2}} \right)$ . Furthermore, we are the first to present a detailed comparison of recently described schemes and protocols that can be used for implementing random beacons.
Polkadot is a decentralized blockchain platform to be launched in 2020. It will implement nominated proof-of-stake (NPoS), a proof-of-stake based mechanism where k nodes are selected by the network as validators to participate in the consensus protocol, according to the preferences expressed by token holders who take the role of nominators. This setup leads to an approval-based multi-winner election problem, where each nominator submits a list of trusted candidates, and has a vote strength proportional to their stake. A solution consists of a committee of k validators, together with a fractional distribution of each nominator's vote among them. We consider two objectives, both recently studied in the literature of social choice. The first one is ensuring the property of proportional justified representation (PJR). The second objective, called maximin support, is to maximize the minimum amount of vote support assigned to any elected validator. We argue that the former objective aligns with the notion of decentralization, while the latter aligns with the security level of the consensus protocol.
We prove that the maximin support problem is constant-factor approximable, as we present several approximation algorithms for it, and prove a matching hardness result. Furthermore, we present an efficient post-computation which, when paired with an approximation algorithm for maximin support, returns a new solution that a) preserves the approximation guarantee, b) satisfies the PJR property, and c) can be efficiently verified to satisfy PJR by an untrusting third party. Besides being of independent theoretical interest, our results enable the network to run an efficient validator election protocol that simultaneously achieves the PJR property and a constant-factor approximation for maximin support, thus offering strong theoretical guarantees on decentralization and security.
We propose an autonomous blockchain-based federated learning (BFL) design for privacy-aware and efficient vehicular communication networking, where local on-vehicle machine learning (oVML) model updates are exchanged and verified in a distributed fashion. BFL enables oVML without any centralized training data or coordination by utilizing the consensus mechanism of the blockchain. Relying on a renewal reward approach, we develop a mathematical framework that features the controllable network and BFL parameters (e.g., the retransmission limit, block size, block arrival rate, and the frame sizes) so as to capture their impact on the system-level performance. More importantly, our rigorous analysis of oVML system dynamics quantifies the end-to-end delay with BFL, which provides important insights into deriving optimal block arrival rate by considering communication and consensus delays. We present a variety of numerical and simulation results highlighting various non-trivial findings and insights for adaptive BFL design. In particular, based on analytical results, we minimize the system delay by exploiting the channel dynamics and demonstrate that the proposed idea of tuning the block arrival rate is provably online and capable of driving the system dynamics to the desired operating point. It also identifies the improved dependency on other blockchain parameters for a given set of channel conditions, retransmission limits, and frame sizes.1However, a number of challenges (gaps in knowledge) need to be resolved in order to realise these changes. In particular, we identify key bottleneck challenges requiring further investigations, and provide potential future research directions.1An early version of this work has been accepted for presentation in IEEE WCNC Wksps 2020 [1].
Michał Król, Alberto Sonnino, Argyrios G. Tasiopoulos, Ioannis Psaras · 5 authors
Decentralised cloud computing platforms enable individuals to offer and rent resources in a peer-to-peer fashion. They must assign resources from multiple sellers to multiple buyers and derive prices that match the interests and capacities of both parties. The assignment process must be decentralised, fair and transparent, but also protect the privacy of buyers. We present PASTRAMI, a decentralised platform enabling trustworthy assignments of items and prices between a large number of sellers and bidders, through the support of multi-item auctions. PASTRAMI uses threshold blind signatures and commitment schemes to provide strong privacy guarantees while making bidders accountable. It leverages the Ethereum blockchain for auditability, combining efficient off-chain computations with novel, on-chain proofs of misbehaviour. Our evaluation of PASTRAMI using Filecoin workloads show its ability to efficiently produce trustworthy assignments between thousands of buyers and sellers.
In recent years blockchain technology has become mainstream research topic because of its decentralized, peer to peer transaction and anonymity properties. There are several applications of blockchain which are secure and easy as compare to the current techniques. One of the applications is a smart contract. Smart contracts are lines of code which are stored on a blockchain and automatically executed when the conditions defined by the it (developer) are met. This smart contract with the addition of blockchain technology can do task fast and with high security. In this paper we have developed a smart contract for a generalized notary application on solidity, Ethereum and the application is tested using the truffle suite. Furthermore, applications and their methodology for notary applications are also mentioned.
Blockchain-enabled Federated Learning (BFL) enables mobile devices to\ncollaboratively train neural network models required by a Machine Learning\nModel Owner (MLMO) while keeping data on the mobile devices. Then, the model\nupdates are stored in the blockchain in a decentralized and reliable manner.\nHowever, the issue of BFL is that the mobile devices have energy and CPU\nconstraints that may reduce the system lifetime and training efficiency. The\nother issue is that the training latency may increase due to the blockchain\nmining process. To address these issues, the MLMO needs to (i) decide how much\ndata and energy that the mobile devices use for the training and (ii) determine\nthe block generation rate to minimize the system latency, energy consumption,\nand incentive cost while achieving the target accuracy for the model. Under the\nuncertainty of the BFL environment, it is challenging for the MLMO to determine\nthe optimal decisions. We propose to use the Deep Reinforcement Learning (DRL)\nto derive the optimal decisions for the MLMO.\n