Distributed Ledger Technologies: Research and Practice最新文献_第2页

AI and Blockchain Enabled Future Wireless Networks: A Survey And Outlook 人工智能和区块链支持的未来无线网络：调查与展望

Distributed Ledger Technologies: Research and Practice Pub Date : 2024-03-01 DOI: 10.1145/3644369

Ziyi Zhou, Oluwakayode Onireti, Hao Xu, Lei Zhang, Muhammad Imran

引用次数: 0

Assessing Routing Algorithms for Payment Channel Networks 评估支付通道网络的路由算法

Distributed Ledger Technologies: Research and Practice Pub Date : 2024-01-30 DOI: 10.1145/3643566

David Lobmaier, Rafael Konlechner, Stefan Schulte, Ingo Weber

引用次数: 0

BUNGEE: Dependable Blockchain Views for Interoperability BUNGEE：实现互操作性的可靠区块链视图

Distributed Ledger Technologies: Research and Practice Pub Date : 2024-01-30 DOI: 10.1145/3643689

R. Belchior, Limaris Torres, Jonas Pfannschmidt, André Vasconcelos, Miguel Correia

{"title":"BUNGEE: Dependable Blockchain Views for Interoperability","authors":"R. Belchior, Limaris Torres, Jonas Pfannschmidt, André Vasconcelos, Miguel Correia","doi":"10.1145/3643689","DOIUrl":"https://doi.org/10.1145/3643689","url":null,"abstract":"With the evolution of distributed ledger technology (DLT), several blockchains that provide enhanced privacy guarantees and features, including Corda, Hyperledger Fabric, and Canton, are being increasingly adopted. These distributed ledgers only provide partial consistency, meaning that participants can observe the same ledger differently, i.e., observe some transactions but not others, providing higher levels of privacy to the end-user.\u0000 \u0000 Choosing privacy instead of transparency leads to delicate trade-offs that are difficult to manage during runtime, hampering the development of applications that depend on reasoning about shared state, e.g., asset transfers across blockchains. We propose using the concept of\u0000 blockchain view\u0000 (view) – an abstraction of the state a participant can access at a certain point to address this problem. Views allow us to systematically reason about either state partitions within the same DLT or an integrated view spanning across several DLTs. We introduce BUNGEE (Blockchain UNifier view GEnErator), the first DLT view generator, to allow capturing snapshots, constructing views from these snapshots, and merging views according to a set of rules specified by the view stakeholders. Creating views and operating views allows new applications built on top of dependable blockchain interoperability, such as stakeholder-centric snapshots for audits, cross-chain analysis, blockchain migration, and combined on-chain-off-chain analytics.\u0000","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"36 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140484200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Design and Implementation of Static Analyses for Tezos Smart Contracts Tezos 智能合约静态分析的设计与实现

Distributed Ledger Technologies: Research and Practice Pub Date : 2024-01-29 DOI: 10.1145/3643567

L. Olivieri, L. Negrini, Vincenzo Arceri, Thomas Jensen, F. Spoto

引用次数: 0

Co-Sharding: A Sharding Scheme for Large-Scale Internet of Things Application 联合分片：大规模物联网应用的分片方案

Distributed Ledger Technologies: Research and Practice Pub Date : 2024-01-19 DOI: 10.1145/3641290

Haotian Yang, Xiaoyu Zhang, Zihan Wu, Liangmin Wang, Xiao Chen, Lu Liu

{"title":"Co-Sharding: A Sharding Scheme for Large-Scale Internet of Things Application","authors":"Haotian Yang, Xiaoyu Zhang, Zihan Wu, Liangmin Wang, Xiao Chen, Lu Liu","doi":"10.1145/3641290","DOIUrl":"https://doi.org/10.1145/3641290","url":null,"abstract":"\u0000 Blockchain technology finds widespread application in the management of Internet of Things (IoT) devices. In response to the challenges posed by performance scalability and the convergence of multiple ledgers stemming from an expanding network, this study introduces the concept of\u0000 Co-Sharding\u0000 . Within this framework, the ledger maintained by sub-chains overseeing IoT operations in distinct geographic regions is conceptualized as a shard within the Large-scale Internet of Things (LIOT) ledger. Meanwhile, elected nodes within each region assume responsibility for maintaining a coordinating shard, facilitating cross-regional communication and data interaction. Furthermore, our work presents a multi-objective optimization algorithm grounded in the multi-shard paradigm to enact a scheduling strategy that spans various regions. We undertake a series of pertinent experiments and conduct a comparative analysis of scheduling algorithms within the context of a real-world cross-regional agricultural IoT system, utilizing actual operational data. The comparative results demonstrate that, in comparison to intra-sub-region scheduling, the\u0000 Co-Sharding\u0000 approach enhances machine utilization rates by approximately 30% and reduces scheduling time by around 18% when confronted with a task count of twelve. In terms of performance,\u0000 Co-Sharding\u0000 also exhibits the capability to reduce the storage requirements of lightweight nodes within each region by approximately 39%, while concurrently improving throughput by approximately 1.5 times when contrasted with a single-chain architecture.\u0000","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139525033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Blockchain-based Execution of BPMN Choreographies with Multiple Instances 基于区块链的多实例 BPMN 流程执行

Distributed Ledger Technologies: Research and Practice Pub Date : 2023-12-15 DOI: 10.1145/3637555

Flavio Corradini, A. Marcelletti, A. Morichetta, Andrea Polini, B. Re, F. Tiezzi

{"title":"Blockchain-based Execution of BPMN Choreographies with Multiple Instances","authors":"Flavio Corradini, A. Marcelletti, A. Morichetta, Andrea Polini, B. Re, F. Tiezzi","doi":"10.1145/3637555","DOIUrl":"https://doi.org/10.1145/3637555","url":null,"abstract":"The recent growth of blockchain has opened the use of technology for supporting the creation of new kinds of trustable systems. Model-driven engineering methodologies have been conceived to facilitate the automatic generation and deployment of software applications starting from the definition and refinement of abstract specification. BPMN choreography diagrams permit the representation of inter-organisational systems from a high-level perspective, just focusing on message exchange. However, the usage of such models in a blockchain-based setting has been limited to scenarios in which parties are involved in single interactions. This aspect becomes significantly relevant when considering complex applications, and in particular those in the realm of the Internet of Things. In these cases, the multiplicity of parties and their actions is crucial and requires novel solutions. In this work, we propose a novel approach for modelling, refining, deploying, and executing a Choreography on the blockchain, taking into account those scenarios in which the model includes multiple-instances. In particular, the considered models are translated into smart contracts able to correctly manage multiplicity. To demonstrate the approach’s feasibility, we designed and presented a Smart Thermostat application, that is executed on the Polygon blockchain.","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"237 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138997158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fake News, Misinformation and Privacy: How the COVID-19 Pandemic Changes our Society and How Blockchain and Distributed Ledger Technologies Reduce Their Effects? 假新闻、错误信息和隐私：COVID-19 大流行如何改变我们的社会，区块链和分布式账本技术如何减少其影响？

Distributed Ledger Technologies: Research and Practice Pub Date : 2023-12-07 DOI: 10.1145/3636431

Kevin K. W. Ho, Dickson K. W. Chiu, Ch (Allen) Au, F. Dalisay, Stuart So, Masahiro Yamamoto

引用次数: 0

Feasibility Analysis for Sybil Attacks in Shard-Based Permissionless Blockchains 基于分片的无权限区块链中Sybil攻击的可行性分析

Distributed Ledger Technologies: Research and Practice Pub Date : 2023-09-02 DOI: 10.1145/3618302

Tayebeh Rajabi, Alvi Ataur Khalil, M. Manshaei, Mohammad Ashiqur Rahman, Mohammad Dakhilalian, Maurice Ngouen, Murtuza Jadliwala, A. Uluagac

{"title":"Feasibility Analysis for Sybil Attacks in Shard-Based Permissionless Blockchains","authors":"Tayebeh Rajabi, Alvi Ataur Khalil, M. Manshaei, Mohammad Ashiqur Rahman, Mohammad Dakhilalian, Maurice Ngouen, Murtuza Jadliwala, A. Uluagac","doi":"10.1145/3618302","DOIUrl":"https://doi.org/10.1145/3618302","url":null,"abstract":"Committee-based permissionless blockchain approaches overcome single leader consensus protocols’ scalability issues by partitioning the outstanding transaction set into shards and selecting multiple committees to process these transactions in parallel. However, by design, shard-based blockchain solutions are vulnerable to Sybil attacks. An adversary with enough computational/hash power can easily manipulate the consensus protocol by generating multiple valid node identifiers/IDs (i.e., multiple Sybil committee members). Despite the straightforward nature of these attacks, they have not been systematically investigated. This paper fills this research gap by analyzing Sybil attacks in shard-based consensus of PoW blockchain systems. Specifically, we provide a detailed analysis for Elastco, one of the prominent shard-based blockchain models. We show that the PoW technique used for ID generation in the initial phase of such protocols is vulnerable to Sybil attacks when an adversary (could be a group of colluding nodes) possesses enough hash power. We analytically derive conditions for two different Sybil attacks and perform numerical simulations to validate our theoretical results under various parameters. Further, we utilize the BlockSim simulator to validate our mathematical computation and results confirm the correctness of the analysis.","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

FORTIS: Selfish Mining Mitigation by (FOR)geable (TI)me(S)tamps FORTIS:由(FOR)geable (TI)me(S)tamps的自私采矿缓解

Distributed Ledger Technologies: Research and Practice Pub Date : 2023-08-24 DOI: 10.1145/3616397

O. Biçer, Alptekin Küpçü

{"title":"FORTIS: Selfish Mining Mitigation by (FOR)geable (TI)me(S)tamps","authors":"O. Biçer, Alptekin Küpçü","doi":"10.1145/3616397","DOIUrl":"https://doi.org/10.1145/3616397","url":null,"abstract":"\u0000 The selfish mining (SM) attack of Eyal and Sirer allows a rational mining pool with a hash power (\u0000 α\u0000 ) much less than 50% of the whole Bitcoin network to steal from the fair shares of honest miners. This attack has been studied extensively in various settings in order for its optimization and mitigation. In this context, Heilman proposes a defense “Freshness Preferred”, based on timestamps, which are issued routinely by a timestamp authority. In contrast, we consider the case where timestamps are generated by no authority; instead every miner includes the current time into a block freely. However, due to two attacks that we discover, this turns out to be a non-trivial task. These attacks are\u0000 Oracle mining\u0000 , which works by cleverly setting the timestamp to future, and\u0000 Bold mining\u0000 , which works by generating an alternative chain starting from a previous block. Unfortunately, these attacks are hard to analyze and optimize, and to our knowledge, the available tools fail to help us for this task. To ease this, we come up with generalized formulas for revenue and profitability of SM attacks. Our analyses show that the use of timestamps could be promising for selfish mining mitigation. Nevertheless, Freshness Preferred in its current form is quite vulnerable, as any rational miner with\u0000 α\u0000 > 0 can directly benefit from our attacks. To cope with this problem, we propose a novel SM mitigation algorithm\u0000 Fortis\u0000 without an authority, which protects the honest miners’ shares against any attacker with\u0000 \u0000 (alpha lt 27.0% )\u0000 \u0000 against all the known SM-type attacks. By building upon the blockchain simulator BlockSim, we simulate our Oracle and Bold mining attacks against Freshness Preferred and\u0000 Fortis\u0000 . Simulation results also demonstrate the effectiveness of these attacks against the former and their ineffectiveness against the latter.\u0000","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131329719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

GBT-CHAIN: A System Framework for Solving the General Trilemma in Permissioned Blockchains GBT-CHAIN:解决许可区块链中一般三难困境的系统框架

Distributed Ledger Technologies: Research and Practice Pub Date : 2023-08-23 DOI: 10.1145/3615871

Han Wang, Hui Li, Abla Smahi, Mingrui Xiao, Shuo Li

{"title":"GBT-CHAIN: A System Framework for Solving the General Trilemma in Permissioned Blockchains","authors":"Han Wang, Hui Li, Abla Smahi, Mingrui Xiao, Shuo Li","doi":"10.1145/3615871","DOIUrl":"https://doi.org/10.1145/3615871","url":null,"abstract":"\u0000 As a subset of distributed systems, blockchain technology is equally bound by the CAP trilemma. Specifically, no distributed system can satisfy consistency, availability, and partition tolerance simultaneously. Informally, the innovative blockchain trilemma has been theorized to include security, scalability, and decentralization. While many software approaches on blockchains claim to solve the trilemma problem, almost all known approaches have been proven to involve trade-offs and fail to reach the upper bounds, meaning they do not achieve the theoretical limit value in each term of a trilemma. In this paper, we propose a general trilemma based on the above two. For permissioned blockchains, we then describe a system framework called GBT-CHAIN to solve the\u0000 G\u0000 eneral\u0000 B\u0000 lockchain\u0000 T\u0000 rilemma. In the proposed framework, the consensus and data layer, the network layer and the physical layer work in cooperation. According to our theoretical proof and experimental analysis, the three properties of the trilemma consisting of consistency, scalability, and partition tolerance are perfectly satisfied without trade-offs. Our results demonstrate that the general blockchain trilemma is resolved by combining consensus algorithms and physical topologies, in particular for permissioned blockchains.\u0000","PeriodicalId":380482,"journal":{"name":"Distributed Ledger Technologies: Research and Practice","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131208501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0