信息工程最新文献

{"title":"Partial pre-image attack on Proof-of-Work based blockchains","authors":"","doi":"10.1016/j.bcra.2024.100194","DOIUrl":"10.1016/j.bcra.2024.100194","url":null,"abstract":"<div><p>Blockchain is a type of distributed ledger technology that consists of a growing list of records, called blocks, that are securely linked together using cryptography. Each blockchain-based solution deploys a specific consensus algorithm that guarantees the consistency of the ledger over time. The most famous, and yet claimed to be the most secure, is the Proof-of-Work (PoW) consensus algorithm. In this paper, we revisit the fundamental calculations and assumptions of this algorithm, originally presented in the Bitcoin white paper. We break down its claimed calculations in order to better understand the underlying assumptions of the proposal. We also propose a novel formalization model of the PoW mining problem using the Birthday paradox. We utilize this model to formalize and analyze partial pre-image attacks on PoW-based blockchains, with formal analysis that confirms the experimental results and the previously proposed implications. We build on those analyses and propose new concepts for benchmarking the security of PoW-based systems, including Critical Difficulty and Critical Difficulty per given portion. Our calculations result in several important findings, including the profitability of launching partial pre-image attacks on PoW-based blockchains, once the mining puzzle difficulty reaches a given threshold. Specifically, for any compromised portion of the network (<span><math><mi>q</mi><mo>&lt;</mo><mn>0.5</mn></math></span>; honest majority assumption still holds), the attack is formally proven profitable once the PoW mining puzzle difficulty reaches 56 leading zeros.</p></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2096720924000071/pdfft?md5=f39562da38a21729770c2b928c68923e&pid=1-s2.0-S2096720924000071-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140268941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analyzing voting power in decentralized governance: Who controls DAOs?","authors":"Robin Fritsch,&nbsp;Marino Müller,&nbsp;Roger Wattenhofer","doi":"10.1016/j.bcra.2024.100208","DOIUrl":"10.1016/j.bcra.2024.100208","url":null,"abstract":"<div><div>We empirically study the state of three prominent DAO governance systems on the Ethereum blockchain: Compound, Uniswap and Ethereum name service (ENS). In particular, we examine how the voting power is distributed in these systems. Using a comprehensive dataset of all governance token holders, delegates, proposals, and votes, we analyze who holds the voting power and how this power is being used to influence governance decisions. While we reveal that the majority of voting power is concentrated in the hands of a small number of addresses, we rarely observe these powerful entities overturning a vote by choosing a different outcome than that of the overall community and less influential voters.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142320258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Prism blockchain enabled Internet of Things with deep reinforcement learning","authors":"","doi":"10.1016/j.bcra.2024.100205","DOIUrl":"10.1016/j.bcra.2024.100205","url":null,"abstract":"<div><div>This paper presents a Deep Reinforcement Learning (DRL) based Internet of Things (IoT)-enabled Prism blockchain. The recent advancements in the field of IoT motivate the development of a secure infrastructure for storing and sharing vast amounts of data. Blockchain, a distributed and immutable ledger, is best known as a potential solution to data security and privacy for the IoT. The scalability of blockchain, which should optimize the throughput and handle the dynamics of the IoT environment, becomes a challenge due to the enormous amount of IoT data. The critical challenge in scaling blockchain is to guarantee decentralization, latency, and security of the system while optimizing the transaction throughput. This paper presents a DRL-based performance optimization for blockchain-enabled IoT. We consider one of the recent promising blockchains, Prism, as the underlying blockchain system because of its good performance guarantees. We integrate the IoT data into Prism blockchain and optimize the performance of the system by leveraging the Proximal Policy Optimization (PPO) method. The DRL method helps to optimize the blockchain parameters like mining rate and mined blocks to adapt to the environment dynamics of the IoT system. Our results show that the proposed method can improve the throughput of Prism blockchain-based IoT systems while preserving Prism performance guarantees. Our scheme can achieve 1.5 times more system rewards than IoT-integrated Prism. In our experimental setup, the proposed scheme could improve the average throughput of the system by about 6,000 transactions per second compared to Prism.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2096720924000186/pdfft?md5=9d5944398ef57f0ec758734d7337bddd&pid=1-s2.0-S2096720924000186-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141050211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Privacy-preserving pathological data sharing among multiple remote parties","authors":"","doi":"10.1016/j.bcra.2024.100204","DOIUrl":"10.1016/j.bcra.2024.100204","url":null,"abstract":"<div><p>The sharing of pathological data is highly important in various applications, such as remote diagnosis, graded diagnosis, illness treatment, and specialist system development. However, ensuring reliable, secure, privacy-preserving, and efficient sharing of pathological data poses significant challenges. This paper presents a novel solution that leverages blockchain technology to ensure reliability in pathological data sharing. Additionally, it employs conditional proxy re-encryption (C-PRE) and public key encryption with equality test technology to control the scope and preserve the privacy of shared data. To assess the practicality of our solution, we implemented a prototype system using Hyperledger Fabric and conducted evaluations with various metrics. We also compared the solution with relevant schemes. The results demonstrate that the proposed solution effectively meets the requirements for pathological data sharing and is practical in production scenarios.</p></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2096720924000174/pdfft?md5=2f0d8f88a5acc867cc2092153e8fba03&pid=1-s2.0-S2096720924000174-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141045558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Toward scalable docker-based emulations of blockchain networks for research and development","authors":"Diego Pennino ,&nbsp;Maurizio Pizzonia","doi":"10.1016/j.bcra.2024.100212","DOIUrl":"10.1016/j.bcra.2024.100212","url":null,"abstract":"<div><div>Blockchain, like any other complex technology, needs a strong testing methodology to support its evolution in both research and development contexts. Setting up meaningful tests for permissionless blockchain technology is a notoriously complex task for several reasons: software is complex, a large number of nodes are involved, the network is non-ideal, etc. Developers usually adopt small virtual laboratories or costly real devnets based on real software. Researchers usually prefer simulations of a large number of nodes based on simplified models.</div><div>In this paper, we aim to obtain the advantages of both approaches, i.e., performing large, realistic, inexpensive, and flexible experiments, using real blockchain software within a virtual environment. To do that, we address the challenge of running large blockchain networks in a single physical machine, leveraging Linux and Docker. We analyze a number of problems that arise when large blockchain networks are emulated, and we provide technical solutions for all of them. Finally, we describe two experiences of emulating fairly large blockchain networks on a single machine: adopting both research-oriented and production-oriented software and involving more than 3000 containers.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-task learning for PBFT optimisation in permissioned blockchains","authors":"","doi":"10.1016/j.bcra.2024.100206","DOIUrl":"10.1016/j.bcra.2024.100206","url":null,"abstract":"<div><div>Finance, supply chains, healthcare, and energy have an increasing demand for secure transactions and data exchange. Permissioned blockchains fulfilled this need thanks to the consensus protocol that ensures that participants agree on a common value. One of the most widely used protocols in private blockchains is the Practical Byzantine Fault Tolerance (PBFT), which tolerates up to one-third of Byzantine nodes, performs within partially synchronous systems, and has superior throughput compared to other protocols. It has, however, an important bandwidth consumption: <span><math><mn>2</mn><mi>N</mi><mo>(</mo><mi>N</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span> messages are exchanged in a system composed of <em>N</em> nodes to validate only one block.</div><div>It is possible to reduce the number of consensus participants by restricting the validation process to nodes that have demonstrated high levels of security, rapidity, and availability. In this paper, we propose the first database that traces the behavior of nodes within a system that performs PBFT consensus. It reflects their level of security, rapidity, and availability throughout the consensus. We first investigate different Single-Task Learning (STL) techniques to classify the nodes within our dataset. Then, using Multi-Task Learning (MTL) techniques, the results are much more interesting, with classification accuracies over 98%. Integrating node classification as a preliminary step to the PBFT protocol optimizes the consensus. In the best cases, it is able to reduce the latency by up to 94% and the communication traffic by up to 99%.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2096720924000198/pdfft?md5=e11c2d536c1985f173948098606e4b4b&pid=1-s2.0-S2096720924000198-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141051117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A privacy-preserving data aggregation system based on blockchain in VANET","authors":"Ruicheng Yang ,&nbsp;Guofang Dong ,&nbsp;Zhengnan Xu ,&nbsp;Juangui Ning ,&nbsp;Jianming Du","doi":"10.1016/j.bcra.2024.100210","DOIUrl":"10.1016/j.bcra.2024.100210","url":null,"abstract":"<div><div>In the realm of vehicular ad hoc networks (VANETs), data aggregation plays a pivotal role in bringing together data from multiple vehicles for further processing and sharing. Erroneous data feedback can significantly impact vehicle operations, control, and overall safety, necessitating the assurance of security in vehicular data aggregation. Addressing the security risks and challenges inherent in data aggregation within VANETs, this paper introduces a blockchain-based scheme for secure and anonymous data aggregation. The proposed scheme integrates cloud computing with blockchain technology, presenting a novel blockchain-based data aggregation system that robustly supports efficient and secure data collection in VANETs. Leveraging key escrow resilience mechanisms, the solution ensures the security of system keys, preventing the security problems caused by keys generated by third parties alone in the past. Furthermore, through secondary data aggregation, fine-grained data aggregation is achieved, providing effective support for cloud services in VANETs. The effectiveness of the proposed scheme is confirmed through security analysis and performance evaluations, demonstrating superior computational and communication efficiency compared existing alternatives.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":null,"pages":null},"PeriodicalIF":6.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141711744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Genetic diversity, virulence profiles, and antimicrobial resistance of Salmonella enterica serovar Typhi isolated from typhoid fever patients in Baghdad, Iraq","authors":"Muna Sabah Dawood,&nbsp;Nadheema Hammood Hussein,&nbsp;Khetam Habeeb Rasool","doi":"10.1016/j.jobb.2024.08.001","DOIUrl":"10.1016/j.jobb.2024.08.001","url":null,"abstract":"<div><p>Typhoid fever is an important health issue in developing countries, and the pathogenicity of <em>Salmonella enterica</em> serovar Typhi (<em>S.</em> ser. Typhi) depends on the presence of different virulence factors. Therefore, this study aimed to investigate the spread of virulence genes among <em>S.</em> Typhi isolates from patients with typhoid fever in Baghdad, Iraq. Sixty <em>S.</em> Typhi isolates were collected from several hospitals in Baghdad and identified using VITEK-II and confirmed by polymerase chain reaction <strong>(</strong>PCR) to detect the <em>16S rRNA</em> gene. After testing their susceptibility to different antimicrobials (via the disk diffusion method), we found the highest resistance rates (100 %) were to ampicillin, piperacillin, cefotaxime, and ceftriaxone. The highest sensitivity rates (100 %) were to ertapenem, imipenem, meropenem, and sulfamethoxazole/trimethoprim. The presence of genes encoding for virulence in <em>S.</em> Typhi isolates was tested by conventional PCR. The results showed that out of 60 isolates, 59 (98.3 %), 59 (98.3 %), 58 (96.7 %), and 60 (100 %) were positive for <em>viaB, staA, cdtB,</em> and <em>orfL</em> genes, respectively. The sequencing of PCR products (<em>viaB, staA, cdtB,</em> and <em>orfL</em> genes) was carried out at the Macrogen Company (Seoul, Korea). The sequences were compared with nucleotide sequences in the BLAST GenBank database, and data obtained from the sequencing of these virulence genes were submitted to GenBank under different accession numbers. A phylogenetic analysis of the <em>16S rRNA</em> gene sequence found a high similarity between local sequences and the closely related sequences of genes in GenBank. The presence of the <em>viaB, staA, cdtB,</em> and <em>orfL</em> virulence genes in nearly all of the isolates under examination suggests that they play an important role in the pathogenicity of local isolates.</p></div>","PeriodicalId":52875,"journal":{"name":"Journal of Biosafety and Biosecurity","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2588933824000396/pdfft?md5=29e047c9e195776b3f4303349920534c&pid=1-s2.0-S2588933824000396-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142083192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Competing with autonomous model vehicles: a software stack for driving in smart city environments","authors":"Julius Bächle,&nbsp;Jakob Häringer,&nbsp;Noah Köhler,&nbsp;Kadir-Kaan Özer,&nbsp;Markus Enzweiler,&nbsp;Reiner Marchthaler","doi":"10.1007/s43684-024-00074-w","DOIUrl":"10.1007/s43684-024-00074-w","url":null,"abstract":"<div><p>This article introduces an open-source software stack designed for autonomous 1:10 scale model vehicles. Initially developed for the Bosch Future Mobility Challenge (BFMC) student competition, this versatile software stack is applicable to a variety of autonomous driving competitions. The stack comprises perception, planning, and control modules, each essential for precise and reliable scene understanding in complex environments such as a miniature smart city in the context of BFMC. Given the limited computing power of model vehicles and the necessity for low-latency real-time applications, the stack is implemented in C++, employs YOLO Version 5 s for environmental perception, and leverages the state-of-the-art Robot Operating System (ROS) for inter-process communication. We believe that this article and the accompanying open-source software will be a valuable resource for future teams participating in autonomous driving student competitions. Our work can serve as a foundational tool for novice teams and a reference for more experienced participants. The code and data are publicly available on GitHub.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00074-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142411651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Pseudovirus technology in global health: A critical need for robust biosecurity measures","authors":"Abhijit Poddar ,&nbsp;S.R. Rao","doi":"10.1016/j.jobb.2024.07.002","DOIUrl":"10.1016/j.jobb.2024.07.002","url":null,"abstract":"","PeriodicalId":52875,"journal":{"name":"Journal of Biosafety and Biosecurity","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2588933824000384/pdfft?md5=e08b2d7d323a451bf516682ba068e063&pid=1-s2.0-S2588933824000384-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142050451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}