【Author】 Apat, Hemant Kumar Sahoo, Bibhudatta
【影响因子】11.718
【主题类别】
--
【Abstract】With the rapid development of Internet of Things (IoT) devices, the volume of data generate across various fields, such as smart healthcare, smart home, smart transportation has significantly increased. This surge raises serious concerns about the secure storage of sensitive data for e.g., biometric information (e.g., fingerprints and facial recognition) and medical records etc. The centralized cloud computing paradigm provides various costeffective services to IoT applications users. Despite of various benefits of centralized cloud, it fails to adequately meet the strict latency and security requirement of various IoT applications. Fog computing is proposed to enhance the real-time data processing for various latency sensitive IoT applications by extending the cloud computing services closer to the data sources. In this paper we proposed a novel blockchain based distributed fog computing model that ensures secure distributed storage for various IoT data. The blockchain network acts a trusted third party aimed at establishing secure communication among IoT devices and fog node within the fog layer. It details a distinctive Elliptic Curve Diffie-Hellman (ECDH) protocol for reliable and secure data storage and retrieval based on requests and responses from heterogeneous IoT devices. Additionally, a Merkle tree-based data structure is used to verify data integrity, ensuring secure and tamper-proof data management within the blockchain-enabled fog computing framework. It provides a formal security proof using AVISPA tools for the proposed scheme, ensuring that it meets the necessary security standards and can be trusted for protecting sensitive IoT data. Finally, the proposed scheme is compared with existing security schemes, such as AES, ABE, RSA, and Hybrid RSA in terms of resource utilization, computational cost, communication cost and execution cost. The experimental results exemplify that the proposed scheme outperform other state of the art schemes.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Fog computing; Internet of things; Blockchain; Security; Authentication; Merkle tree; Data integrity
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Dong, Shi Su, Huadong Hou, Ruizhe Shankar, Achyut
CCF-B
【影响因子】9.551
【主题类别】
--
【Abstract】The consensus mechanism is crucial to blockchain performance, making it essential to design a mechanism that aligns with the characteristics of the Internet of Things (IoT). This paper focuses on the application of PBFT consensus mechanism in the Internet of things. However, it is found that the current PBFT consensus mechanisms need to address some problems, such as communication overhead, bandwidth occupation and privacy protection. In this paper, we propose a voting sorting clustering mechanism based on group signatures to enhance the PBFT consensus mechanism (IPBFT), ensuring privacy protection between Internet of Things nodes. Finally, the communication efficiency is improved. The voting sorting clustering method reduces the communication probability with the nodes, and decreases the communication overhead and bandwidth occupation. Experimental results show that compared with other mechanisms, the proposed mechanism increases throughput, reduces communication overhead and bandwidth occupation, and alleviates privacy protection problems.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Internet of Things; Consensus protocol; Throughput; Fault tolerant systems; Fault tolerance; Delays; Consensus algorithm; Scalability; Protection; Clustering algorithms; Consensus mechanism; consortium blockchain; PBFT; IoT; clustering mechanism; group signature
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】9.235
【主题类别】
--
【Abstract】Decentralized storage platforms based on consortium blockchains have emerged in the spotlight of research and industry communities because they are flexible, transparent, and eliminated trust in contrast to the traditional centralized data-sharing model. However, due to wide attacking surfaces in a blockchain network, this decentralized data-sharing paradigm is subject to malicious data breaches. Untrusted blockchain nodes can directly obtain sensitive information from the query processing and their local storage. Several studies have been made for solving this dilemma, but they only focus on single-user settings and cannot be directly applied to multi-owners blockchain-based data sharing scenarios. In this paper, we introduce FedEDB, a federated and encrypted data store by using consortium blockchains. Unlike existing solutions that focus on single-user settings, our proposed schemes can efficiently support privacy-preserving and reliable multi-owner queries in the decentralized setting. We start from the practical key aggregation technique to construct the multi-owner search schemes and further refine the underling building blocks to enhance the security. Besides, we integrate the smart contract with our tailored zero-knowledge proof to enforce secure and reliable result verification protocol with fairness. We implement a prototype and thorough security analysis and comprehensive evaluation results confirm the practicability of our design.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchains; Cryptography; Smart contracts; Protocols; Servers; Indexes; Encryption; Blockchain; decentralized applications; searchable encryption; smart contract; zero-knowledge proof
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】8.263
【主题类别】
--
【Abstract】Blockchain systems have always faced the challenge of performance bottlenecks, and sharding technology is considered a promising mainstream on-chain scalability solution to solve this problem. Due to the complexity and high cost of the cross-shard transaction processing mechanism in the sharding blockchain system, as well as the high proportion of cross-shard transactions, it becomes challenging for the sharding blockchain system to reach the ideal theoretical performance upper limit. Therefore, this paper aims to reduce the proportion of cross-shard transactions by dividing accounts with frequent transactions into the same shard, thereby improving system throughput. This paper builds a hypergraph based on historical transaction data to represent the diverse transaction relationships between accounts, and formulates the account division problem in the blockchain as a community discovery problem on the hypergraph structure. A time-aware community detection algorithm is proposed to partition accounts by considering the sustainability of transaction relationships between accounts. This also solves the problem of community detection algorithms tending to partition into larger shards. In addition, this paper builds a local Ethereum test network and implements the proposed algorithm on areal transaction dataset. Experimental results show that this algorithm can reduce the proportion of cross-shard transactions from about 95% to about 10%. Furthermore, it shows superior performance in terms of transaction throughput and latency compared with other community detection-based account partitioning algorithms.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchain; Sharding; Community detection; Cross-shard transaction
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Byzantine Fault Tolerance (BFT) Consensus protocols with trusted hardware assistance have been extensively explored for their improved resilience to tolerate more faulty processes. Nonetheless, the potential of trust hardware has been scarcely investigated in leaderless BFT protocols. RedBelly is assumed to be the first blockchain network whose consensus is based on a truly leaderless BFT algorithm. This paper proposes a trusted hardware-assisted leaderless BFT consensus protocol by offering a hybrid solution for the set BFT problem defined in the RedBelly blockchain. Drawing on previous studies, we present two crucial trusted services: the counter and the collector. Based on these two services, we introduce two primitives to formulate our leaderless BFT protocol: a hybrid verified broadcast (VRB) protocol and a hybrid binary agreement. The hybrid VRB protocol enhances the hybrid reliable broadcast protocol by integrating a verification function. This addition ensures that a broadcast message is verified not only for authentication but also for the correctness of its content. Our hybrid BFT consensus is integrated with these broadcast protocols to deliver binary decisions on all proposals. We prove the correctness of the proposed hybrid protocol and demonstrate its enhanced performance in comparison to the prior trusted BFT protocol.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Protocols; Reliability; Proposals; Complexity theory; Hardware; Resilience; Fault tolerant systems; Reliable broadcast; byzantine fault tolerance; trusted execution environment; trusted services
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Benefiting from the booming of Big Data and artificial intelligence (AI) technologies, data-as-a-service is gradually transforming into knowledge-as-a-service. Extracting knowledge from massive raw data is becoming a popular paradigm to save network resources and improve efficiency, and establishing knowledge markets is receiving increasing attention from academia and industry. In this paper, we propose a one-stop knowledge acquisition ecosystem termed BWKA that covers the whole process from upper-layer knowledge trading to underlying knowledge generation. In the knowledge trading process, the knowledge-as-a-service platform (KSP) is the buyer and publishes knowledge demands to multiple local knowledge sellers (LKSs). In the knowledge generation process, each LKS aggregates data from its sensors and then trains data into knowledge according to the KSP's requirements. We resort to blockchain technology and provide a series of tailored operating rules and functions to protect the truthfulness of data gathering and the fairness of knowledge trading. In addition, we introduce incentive mechanisms to stimulate selfish and rational entities in the BWKA ecosystem to participate in knowledge acquisition. To analyze the strategic interactions among entities theoretically, we develop a nested hierarchical game model, where the upper-layer knowledge trading is evaluated based on the Contract Theory, and the lower-layer knowledge generation is formulated as a two-stage Stackelberg game. By solving the nested hierarchical game in a backward inductive way, we identify the optimal strategy for each entity in closed form. Experiments on the Ethereum blockchain and simulation results demonstrate the practical operability and outstanding performance of the BWKA ecosystem.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Ecosystems; Games; Blockchains; Sensors; Knowledge acquisition; Smart contracts; Ions; Blockchain; hierarchical game; incentive mechanism; knowledge acquisition ecosystem; smart contract
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Xu, Chenhao Ge, Jiaqi Deng, Yao Gao, Longxiang Zhang, Mengshi Li, Yong Zhou, Wanlei Zheng, Xi
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Federated learning (FL) is a distributed framework for machine learning that enables collaborative training of a shared model across data silos while preserving data privacy. However, the FL aggregation server faces a challenge in waiting for a large volume of model parameters from selected nodes before generating a global model, which leads to inefficient communication and aggregation. Although transmitting only the signs of stochastic gradient descent (SignSGD) reduces the transmission load, it decreases model accuracy, and the time waiting for local model collection remains substantial. Moreover, the security of FL is severely compromised by prevalent poisoning, backdoor, and DDoS attacks, causing ineffective and inaccurate model training. To overcome these challenges, this paper proposes a Blockchain-based Asynchronous SignSGD (BASS) architecture for efficient and secure federated learning. By integrating a blockchain-based semi-asynchronous aggregation scheme with sign-based gradient compression, BASS considerably improves communication and aggregation efficiency, while providing resistance against attacks. Besides, a novel node-summarized sign aggregation algorithm is developed for the blockchain leaders to ensure the convergence and accuracy of the global model. An open-source prototype is developed, on top of which extensive experiments are conducted. The results validate the superiority of BASS in terms of efficiency, model accuracy, and security.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Training; Blockchains; Servers; Security; Data models; Federated learning; Computational modeling; Blockchain; efficiency; federated learning; security; SignSGD
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Mobile crowdsensing (MCS) is an efficient approach for large-scale sensing data collection by leveraging the mobility and capability of mobile devices. To avoid the weaknesses of traditional centralized crowdsensing systems, blockchain has been introduced to secure the process of MCS. This article studies a location-aware scenario, where privacy of users are protected in a blockchain- based MCS system, and formulates an optimization problem to maximize the coverage given a budget based on reverse auction. An incentive mechanism named MMCB is further proposed and implemented as smart contracts in blockchain to solve the problem. We demonstrate that the mechanism achieves a set of desirable properties, including computation efficiency, individual rationality, truthfulness, budget feasibility, approximation, and privacy preservation. To protect the identity privacy of workers and obtain anonymity, a linkable ring signature is employed in smart contracts. In addition, a Pedersen commitment is utilized for protecting workers' bid profile and the submitted sensing data is encrypted and only accessible to the requester. We implement a prototype system based on the Hyperledger Fabric platform, and the evaluation results show that our privacy-preserving incentive mechanism architecture improves 36.2% coverage and reduces 53.1% payment with better security level compared to the state-of-the-art schemes.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Crowdsensing; Blockchains; Privacy; Task analysis; Security; Sensors; Smart contracts; Blockchain; incentive mechanism; mobile crowdsensing; privacy preservation
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Saad, Muhammad Mohaisen, David
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Cryptojacking is the permissionless use of a target device to covertly mine cryptocurrencies. With cryptojacking, attackers use malicious JavaScript codes to force web browsers into solving proof-of-work puzzles, thus making money by exploiting the resources of the website visitors. We systematically analyze the static, dynamic, and economic aspects of in-browser cryptojacking to understand and counter such attacks. For static analysis, we perform currency-based and code-based categorization of cryptojacking samples to 1) measure their distribution across websites, 2) highlight their platform affinities, and 3) study their code complexities. We apply machine learning techniques to distinguish cryptojacking scripts from benign and malicious JavaScript samples with 100% accuracy. For dynamic analysis, we analyze the effect of cryptojacking on critical system resources, such as CPU and battery usage. We also perform web browser fingerprinting to analyze the information exchange between the victim node and the dropzone cryptojacking server. We also build an analytical model to empirically evaluate the feasibility of cryptojacking as an alternative to online advertisement. Our results show a sizeable negative profit and loss gap, indicating that the model is economically infeasible. Finally, leveraging insights from our analyses, we build countermeasures for in-browser cryptojacking that improve the existing remedies.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Codes; Internet; Bitcoin; Servers; Peer-to-peer computing; Market research; Browsers; Coinhive; cryptojacking; illegal mining
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Public cloud platforms have employed Trusted Execution Environment (TEE) technology to provide confidential computing services. However, applications running on cloud TEEs are susceptible to rollback or forking attacks. Their states can be rolled back to an outdated version or split into multiple conflicting versions, violating state continuity. Existing solutions against these attacks either rely on centralized trust assumption (e.g., trusted server) or have limited performance (e.g., tens of state updates per second). In this article, we introduce Narrator-Pro (an upgrade to the original Narrator), a secure and practical distributed system that utilizes blockchain technology and TEEs to provide high-performance state continuity protection for TEE applications in the cloud. Specifically, we use the blockchain to initialize the system, which lays down the decentralized trust base with minimal interaction overhead. Meanwhile, we leverage the distributed system composed of TEEs to provide fast and unlimited state updates. We have implemented a proof-of-concept of Narrator-Pro in Intel SGX and conducted extensive evaluations in both the WAN and the LAN. Our results show that in a LAN environment with 5 nodes, Narrator-Pro can support around 8 k state updates per second with a latency of 3.58 ms. This performance is 30x higher than ROTE and 70x higher than using a TPM counter.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Codes; Protocols; Cloud computing; Consensus protocol; Computer crashes; Wide area networks; Operating systems; Trusted execution environment; state continuity; blockchain; forking attack; rollback attack
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-A
【影响因子】6.791
【主题类别】
--
【Abstract】Byzantine fault-tolerant (BFT) state machine replication (SMR) is adopted to support blockchain consensus by tolerating arbitrarily faulty behaviours. However, the inherent complexity of BFT protocols makes existing BFT protocols hard to adapt to large-scale applications that require high scalability and performance. In this article, we propose a BFT parallelism protocol designed to enhance its scalability by using a hierarchical multi-committee architecture. It also encompasses a cross-layer consensus operation flow to improve safety, and support trusted execution environments (TEEs). Our proposed approach allows the lower bound on the number of peers to be reduced to 2f+1. We show the value of our proposed protocol in comparison to other state-of-the-art BFT protocols through experiments and performance evaluations on a testbed built on a cloud platform. The proposed protocol demonstrates a remarkable level of scalability, capable of accommodating a growing number of peers. Additionally, it exhibits improved performance when contrasted with HotStuff and FastBFT, with approximately 100% and 200% enhancements, respectively.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Scalability; Safety; Complexity theory; Parallel processing; Consensus protocol; Computer architecture; Sharding; Parallel BFT; hierarchical architecture; trusted execution environment; secret sharing scheme
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-B
【影响因子】6.166
【主题类别】
--
【Abstract】Integrating the unmanned aerial vehicles (UAVs) assisted mobile edge computing (MEC) network with the blockchain technology emerges its superiority in the network utilization, differentiated service, and security, which has been regarded as a promising technique for time-critical applications. In this paper, we propose a UAV-assisted MEC network architecture and a comprehensive data processing flow, where the UAVs cooperate with the base station in computation as edge servers and act as blockchain nodes. We formulate an optimization problem that jointly considers UAVs' position, data offloading, and resource allocation for minimizing the total time consumption of data processing. To address this problem, we decouple it as three tractable subproblems and propose a Block Coordinate Descent (BCD)-based iterative algorithm. In addition, we analyze the task migration and resource allocation problem in computation, and obtain analytical solutions by the Karush-Kuhn-Tucker (KKT) conditions. The simulated results indicate that the proposed algorithm leads to substantial performance gains.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchains; Autonomous aerial vehicles; Servers; Task analysis; Resource management; Data processing; Network architecture; MEC; UAV; blockchain; wireless networks
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】5.033
【主题类别】
--
【Abstract】Mobile Crowd Sensing (MCS) has emerged as a new sensing paradigm due to its cost efficiency, mobility, and expandability. However, user selection for task allocation is a significant challenge in MCS. Most previous studies concentrate on two selection modes, opportunistic and participatory selection. Recent research has proposed a hybrid user selection mode that combines both advantages. However, existing hybrid user selection systems all rely on a centralized architecture, which is vulnerable to malicious attacks, and they do not consider the reliability of users and data availability. Moreover, they cannot ensure the individual rationality of users. To overcome these shortcomings, we propose a blockchain-based hybrid reliable user selection scheme for task allocation in MCS. Specifically, we replace the traditional central server with the blockchain and handle various sensing task operations using smart contracts on the blockchain to ensure system reliability and security. In addition, we design a user reputation calculation algorithm based on semi-Markov and a sensing data anomaly detection algorithm based on Long Short-Term Memory (LSTM) to ensure user reliability and data availability, and also a novel hybrid user selection algorithm, especially in the participatory user selection stage, where we use a user selection algorithm based on reverse auction to ensure the individual rationality of each user. Experimental results demonstrate the effectiveness of the proposed scheme through simulation experiments on GeoLife and sound-sensing public datasets.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Sensors; Task analysis; Reliability; Security; Resource management; Blockchains; Prediction algorithms; Mobile crowd sensing (MCS); task allocation; hybrid user selection; blockchain-based; long short-term memory (LSTM); semi-Markov
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Yu, Ziqing Chang, Zheng Wang, Li Min, Geyong
【影响因子】5.033
【主题类别】
--
【Abstract】To boost the wide applications of the blockchain, Mobile edge computing (MEC) emerges as potential solution that can provide computing resources in terms of computation offloading. In blockchain, pool mining allows to combine a small amount of computing resources to operate together, which helps the miners with small number of resources mine blocks more efficiently. Therefore, a MEC-enabled blockchain has recently received significant research interests. However, how to encourage the involvements of different parties and operate resource allocation in the MEC-enabled blockchain in an efficient manner are still under-investigation. In this paper, we study the problem of resource allocation in a MEC-enabled blockchain network, and design a novel contract-based incentive mechanism to motivate the MEC service providers (SPs) to provide computing services to blockchain miners. Numerical results demonstrate that the proposed mechanism can improve the payoffs of miners and SPs. Besides, we also analyzed the impact of changes in the number of miners and SPs on network performance based on experimental results, aiming to provide some suggestions to construct efficient resources trading networks.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchains; Resource management; Data mining; Security; Cloud computing; Contracts; Servers; Blockchain; contract theory; mobile edge computing (MEC); mining pool; incentive mechanism
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】5.033
【主题类别】
--
【Abstract】Smart contracts have been widely used for their capability of giving blockchain a user-defined logic. In recent years, several smart contract security incidents have resulted in enormous financial losses. Therefore, it is important to detect vulnerabilities in smart contracts before deployment. Machine learning has been used recently in smart contract vulnerability detection. Unfortunately, due to the loss of information during feature extraction, the detection results are unsatisfactory. Hence, we propose a novel approach called ContractGNN, which combines a new concept of a vulnerability sub-graph (VSG) with graph neural networks (GNNs). Compared with traditional methods, checking a VSG is more accurate because the VSG removes irrelevant vertexes in the control flow graph. Furthermore, a VSG can be aggregated and simplified, thus improving the efficiency of message passing in a GNN. Based on aggregated VSGs, we design a new feature extraction method that preserves semantic information, the order of opcode, and control flows of smart contracts. Moreover, we compare a large number of GNN classification models and select the best one to implement ContractGNN. We then test ContractGNN on 48,493 real-world smart contracts, and the experimental results show that ContractGNN outperforms other smart contract vulnerability detection tools, with an average F1 score of 89.70%.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchain; smart contract; vulnerability detection; vulnerability detection; vulnerability sub-graph (VSG); vulnerability sub-graph (VSG); graph neural network (GNN); graph neural network (GNN); graph neural network (GNN)
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】5.033
【主题类别】
--
【Abstract】As the next generation of the internet, Web 3.0 is expected to revolutionize the Internet and enable users to have greater control over their data and privacy. Federated learning (FL) enables data to be usable yet invisible during its use, thereby facilitating the transfer of data ownership and value. However, the issues of data size and blockchain computing power are of paramount importance for FL in Web 3.0. Due to the openness of Web 3.0, individuals can freely join or leave training and adjust data size, creating population uncertainty and making it difficult to design incentive mechanisms. Therefore, we propose a Poisson game-based FL incentive mechanism that motivates participants to contribute more data and computing power, considering the variability of data size and computing power requirements, and provides a feasible solution to the uncertainty of the number of participants using a Poisson game model. Additionally, our proposed FL architecture in Web 3.0 integrates FL with Decentralized Autonomous Organizations (DAO), utilizing smart contracts for contribution calculation and revenue distribution. This enables an open, free, and autonomous federated learning environment. Experimental evaluation shows that our incentive mechanism is feasible in blockchain with efficiency, robustness, and low overhead.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Federated learning; incentive mechanism; poisson game; smart contract web 3.0; incentive mechanism; poisson game; smart contract web 3.0
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Li, Bixin Pan, Zhenyu Hu, Tianyuan
【影响因子】5.033
【主题类别】
--
【Abstract】Reentrancy vulnerability is one of the most serious security issues in smart contracts, resulting in millions of dollars in economic losses and posing a threat to the trust of the blockchain ecosystem. Therefore, researchers are paying more attention to this problem and have proposed various methods to detect and eliminate potential reentrancy vulnerabilities before contract deployment. Compared to symbolic execution and pattern-matching methods, fuzz testing method can achieve higher accuracy and are better suitable for detecting cross-contract vulnerabilities. However, existing fuzz testing tools often spend a long time exploring states with little pruning, and most of them adopt the reentrancy vulnerability oracle used by static analysis tools, which ignores whether the vulnerability can be exploited to compromise the access control, mutex, or time locks. To address these issues, we propose EvoFuzzer, an evolutionary fuzzer that focuses on the detection of reentrancy vulnerabilities. EvoFuzzer first leverages static analysis to exclude branches that have no impact on state transitions, then continuously optimizes test case generation using a genetic algorithm that considers both function sequence and parameter assignment, and Meanwhile, EvoFuzzer confirms whether reentrancy vulnerabilities can be exploited by simulating attacks. Our experiments have performed on 198 annotated contracts and 47 honeypot contracts, and experimental results show that EvoFuzzer can detect 91.7% of reentrancy vulnerabilities with no false positives, achieve the highest F1 score with 95.7%, which is 5.9% higher than the next best approach (Confuzzius), and we also find that it reduces more than 10% of branches when EvoFuzzer adopts a pruning strategy.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】smart contract; reentrancy; Blockchain; fuzz testing; fuzz testing; reentrancy; fuzz testing
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】5.033
【主题类别】
--
【Abstract】Given the urgency of climate change, many countries have set carbon neutrality targets and adopted cap-and-trade (C&T) systems to regulate carbon emissions. Accurate carbon emission data is crucial for the effective operation of carbon pricing and management systems. Monitoring, Reporting, and Verification (MRV) system is at the core of these systems, facing challenges such as, inefficient verification process, and low-quality carbon emissions verification. Blockchain and smart contracts offer promising solutions to some difficulties, while the quality of carbon emissions verification still needs improvement. Therefore, we propose a blockchain-enhanced carbon emissions verification model to optimize system efficiency and support compliance verification. We employ reputation as the admission criterion, screening reliable and trustworthy verification candidates. We design a game-theoretic incentive mechanism implemented through smart contracts to promote compliance and collaborative quality control among participants. Analysis shows that our scheme drives the game model towards the Nash equilibrium that achieves collaborative quality control. Through security analysis and simulation experiments, we verify the efficacy of our mechanism concerning verification quality and procedural automation, confirming its potential to mitigate malpractices and enhance consistent compliance.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Carbon emissions; Blockchains; Incentive schemes; Climate change; Carbon neutral; Emissions trading; Quality control; Carbon dioxide; Collaboration; Nash equilibrium; Environmental monitoring; Conformance testing; Blockchain; carbon emissions verification; game theory; incentive mechanism; smart contract; incentive mechanism; smart contract
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Wei, Jinyu Zhang, Xin Liu, Yaoxi Jiang, Yingmei
【影响因子】4.803
【主题类别】
--
【Abstract】Purpose This study aims to propose a cloud platform architecture considering information sharing based on blockchain to realize the security and convenience of enterprise information sharing in the automotive supply chain. Design/methodology/approach A bilateral matching model considering enterprises information contribution stimulates information sharing and improves the efficiency and quality of supply and demand matching. Three smart contracts are used to complete the information sharing process and match supply and demand in the automotive supply chain. Findings The system is tested on the local Ganache private chain, and the decentralized web page is designed based on the architecture prototype. Originality/value Solve the problem of information island in automobile supply chain.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchain technology; Supply chain management; Information sharing; Cloud platform
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Cong, Xin Feng, Lanjin Zi, Lingling
【影响因子】3.860
【主题类别】
--
【Abstract】In the digital information age, distributed file storage technologies like the InterPlanetary File System (IPFS) have gained considerable traction as a means of storing and disseminating media content. Despite the advantages of decentralized storage, the proliferation of decentralized technologies has highlighted the need to address the issue of file ownership. The aim of this paper is to address the critical issues of source verification and digital copyright protection for IPFS image files. To this end, an innovative approach is proposed that integrates blockchain, digital signature, and blind watermarking. Blockchain technology functions as a decentralized and tamper-resistant ledger, recording and verifying the source information of files, thereby establishing credible evidence of file origin. A digital signature serves to authenticate the identity and integrity of the individual responsible for uploading the file, ensuring data security. Furthermore, blind watermarking is employed to embed invisible information within images, thereby safeguarding digital copyrights and enabling file traceability. To further optimize the efficiency of file retrieval within IPFS, a dual-layer Distributed Hash Table (DHT) indexing structure is proposed. This structure divides file index information into a global index layer and a local index layer, significantly reducing retrieval time and network overhead. The feasibility of the proposed approach is demonstrated through practical examples, providing an effective solution to the copyright protection issues associated with IPFS image files.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Blockchain; copyright protection; IPFS; distributed hash table; digital signature
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【DOI】 10.32604/cmc.2024.054372
【Author】 Yang, Changsong Liu, Yueling Ding, Yong
CCF-C
【影响因子】3.488
【主题类别】
--
【Abstract】Due to the rapid increasing of the total amount of global digital data, cloud storage has gained wide attention from both academia and industry, since it can offer nearly measureless storage spaces to the resource-constraint clients. As a consequence, by employing cloud storage service, clients are able to store massive data on the remote cloud data center. That is, clients can migrate the local heavy storage burden and expensive computation overhead to the cloud data center. Despite plenty of attractive strengths, cloud storage service is consequentially subjected to a few new severe security problems and privacy challenges, such as data deletion, data insertion, and so on. In this article, we focus on a primary but quite important issue, i.e., fine-grained deletion supporting dynamic insertion over cloud data. Specifically, we improve the classical invertible Bloom filter (IBF) and construct a new data validation structure, namely, invertible Bloom filter tree (IBFT). Subsequently, we connect digital signature and IBFT to design a new scheme that can fulfill fine-grained data deletion as well as dynamic data insertion. In our new solution, only client and cloud data center are involved when inserting/deleting cloud data and validating the insertion/deletion consequences, which makes our new solution more practical. At last, we formally analyze the security and implement a prototype system, in which we implement our new proposed solution and evaluate its performance. The experimental consequences prove that contrasted to a few previous solutions, our new solution equipped with more attractive feasibility and efficiency in the real-world applications.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Cloud data; Fine-grained deletion; Dynamic insertion; Invertible bloom filter tree; Public verifiability
【发表时间】2025
【收录时间】2024-12-01
【文献类型】
【影响因子】2.775
【主题类别】
--
【Abstract】This article identifies how decentralized and interoperable storage solutions create value for service providers. These solutions are invented to serve the fundamental principle that data should not be confined behind company walls. Instead, these solutions facilitate the flow of data between different stakeholders, enabling innovation in data ecosystems through the reuse of information. Through multiple stakeholder interviews, this research explored different ways in which such solutions bring value to service providers. Utilizing the affordance theory, we conclude that, compared to relating technologies such as blockchain and big data analytics, decentralized and interoperable storage solutions bring two additional opportunities; (1) an affordance on interoperable data exchange which enables the reduction of costs (e.g., data cleaning) and (2) an affordance on legal risks and compliance facilitating the reduction of compliancy costs and potential legal risks.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Affordances; Decentralized and interoperable storage; Solid; Capabilities; Data ecosystems
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
CCF-C
【影响因子】2.701
【主题类别】
--
【Abstract】Vehicular ad-hoc networks (VNs) is networks of vehicles that are becoming a potential solution to improve traffic safety and comfort. Vehicles may receive the message and be informed about traffic status when they arrive within the transmission vicinity of the message source or another informed vehicle. Vehicles may send out incorrect messages, so privacy-preserving authentication and trust computation for VNs are a critical task. In this paper, we propose a privacy-preserving authentication trust computation scheme using blockchain to ensure the legitimacy of the messages exchanged by vehicles. Specifically, privacy-preserving mutual authentication using infrastructure-aided methods and the Perron-Frobenius theorem for computing trust in the VN environment are presented. In this proposed scheme, vehicles are normal nodes; however, fixed entities (RSUs) of the VNs are mining nodes. We have also used solo miner as a police vehicle, ambulance, and government vehicle to compute the accurate reputation of vehicles and to reduce false message broadcasting. Extensive experimental results show that the proposed mechanism can effectively evaluate the trust of vehicles using a reward and penalty approach. Furthermore, it can preserve privacy through mutual authentication in one transaction with the proof of presence or absence of VNs.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】Vehicular ad hoc network (VN); Authentication; Privacy preserving; Certificate; Revocation; Merkle tree; CertBC; GrayBC
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【影响因子】2.017
【主题类别】
--
【Abstract】The application of blockchain technology in the realm of the Industrial Internet of Things has garnered significant attention in recent research. One of the critical requirements for Industrial Internet of Things is secure real-time data monitoring. While blockchain presents a robust platform for ensuring secure remote monitoring, it also faces challenges when it comes to real-time data transmission, particularly concerning data packet loss. In this study, we propose a conceptual framework utilizing Hyperledger Fabric blockchain for secure real-time remote monitoring within Industrial Internet of Things applications. To validate this concept, we established a Hyperledger Fabric blockchain network comprising several machines and simulated the monitoring of data packets. Through a series of experiments, we assessed the performance of the Hyperledger Fabric blockchain network regarding secure real-time data monitoring, specifically focusing on data packet loss. In 31 experiments, 18 achieved success with no packet loss, demonstrating effective network functionality. For optimal performance, the time between transaction generation must meet or exceed block generation time to reduce packet loss. Additionally, the sizes of transactions and blocks should align with data packet length, ensuring all sensory data is captured in each transaction. The count of transactions per block varies based on network strategy and monitoring time. Lastly, using robust hardware for network nodes is crucial for enhancing processing speed and storage, ultimately improving network performance. The insights gained from this research can facilitate the practical implementation of blockchain-based real-time industrial data monitoring systems in Industrial Internet of Things environments.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】IoT; IIoT; Blockchain; Hyperledger Fabric blockchain
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【Author】 Biswas, Sujit Sharif, Kashif Latif, Zohaib Alenazi, Mohammed J. F. Pradhan, Ashok Kumar Bairagi, Anupam Kumar
CCF-C
【影响因子】1.345
【主题类别】
--
【Abstract】Smart device manufacturers rely on insights from smart home (SH) data to update their devices, and similarly, service providers use it for predictive maintenance. In terms of data security and privacy, combining distributed federated learning (FL) with blockchain technology is being considered to prevent single point failure and model poising attacks. However, adding blockchain to a FL environment can worsen blockchain's scaling issues and create regular service interruptions at SH. This article presents a scalable Blockchain-based Privacy-preserving Federated Learning (BPFL) architecture for an SH ecosystem that integrates blockchain and FL. BPFL can automate SHs' services and distribute machine learning (ML) operations to update IoT manufacturer models and scale service provider services. The architecture uses a local peer as a gateway to connect SHs to the blockchain network and safeguard user data, transactions, and ML operations. Blockchain facilitates ecosystem access management and learning. The Stanford Cars and an IoT dataset have been used as test bed experiments, taking into account the nature of data (i.e. images and numeric). The experiments show that ledger optimisation can boost scalability by 40-60% in BCN by reducing transaction overhead by 60%. Simultaneously, it increases learning capacity by 10% compared to baseline FL techniques.
你可以尝试使用大模型来生成摘要 立即生成
【Keywords】computer network security; blockchain; federated learning
【发表时间】2024
【收录时间】2024-12-01
【文献类型】
【DOI】 10.1049/cmu2.12870