Zoey Ziyi Li, Han Wang, Dragan Gasevic, Jiangshan Yu, Joseph K. Liu
{"title":"Enhancing Blockchain Adoption through Tailored Software Engineering: An Industrial-grounded Study in Education Credentialing","authors":"Zoey Ziyi Li, Han Wang, Dragan Gasevic, Jiangshan Yu, Joseph K. Liu","doi":"10.1145/3632532","DOIUrl":"https://doi.org/10.1145/3632532","url":null,"abstract":"Recent years have witnessed a marked increase in both academic proposals and industrial adoptions of blockchain technology. However, a majority of the projects remain at the stage of prototype proposals and their real-world deployment has not met the anticipated level. This gap can be attributed to three major barriers - technical difficulties, human factors, and social context. Most of the existing research leans towards addressing the technical challenges, leaving the human and social aspects inadequately explored. Moreover, a lack of practical insights in the existing blockchain software engineering frameworks further exacerbates the adoption problem. To address these gaps, we introduce a Blockchain-oriented Software Engineering Approach for Higher Adoption Possibility (BOSE-HAP) . This approach emphasizes collaboration, reflective thinking, and iterative development, aiming to bolster implementation consistency and stimulate industry adoption. We have applied this approach in the design, development, and launch of a blockchain credentialing product, CValid.org , in the context of a university-level summer school. The product achieves industry-accepted System Usability Score and has seen successful real-world deployment. In addition, this study embed usability considerations throughout the process, involved a total of 112 stakeholders across different development stages, with 25 of them participating in our in-depth interviews and usability testing. Drawing from our firsthand experience and industrial-grounded findings, we deliver 8 reflections and propose 5 best practice suggestions relevant to blockchain adoption. We believe these insights will provide invaluable guidance for both academic researchers and industry practitioners involved in the field of blockchain technology.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"15 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135042741","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}
{"title":"Smart Contracts for Mobile Network Operator Bandwidth Sharing","authors":"Thomas Sandholm, Sayandev Mukherjee","doi":"10.1145/3630168","DOIUrl":"https://doi.org/10.1145/3630168","url":null,"abstract":"We propose a new way to share licensed spectrum bandwidth capacity in mobile networks between operators, service providers and end-users using blockchain-based smart contracts. We discuss the foundational building blocks in the contract as well as various extensions to support more advanced features such as bulk purchases, and future reservations. Furthermore, we demonstrate how the system can be implemented with an open-source, permissioned enterprise blockchain, Hyperledger Sawtooth. We show that our smart contract implementation can improve blockchain transaction performance, by approximately four orders of magnitude compared to serial transactions and one order of magnitude compared to parallel transactions, by using PKI-driven bulk purchases of mobile access grants, paving the way for fully automated, efficient, and fine-grained roaming agreements. We conclude with a discussion of lessons learned from two end-to-end use cases we implemented to validate our distributed ledger design.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":" 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135242372","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}
Oleksandr Antonenko, Sergii Grybniak, Denis Guzey, Oleksandr Nashyvan, Ruslan Shanin
{"title":"Subnetworks in BlockDAG","authors":"Oleksandr Antonenko, Sergii Grybniak, Denis Guzey, Oleksandr Nashyvan, Ruslan Shanin","doi":"10.1145/3627540","DOIUrl":"https://doi.org/10.1145/3627540","url":null,"abstract":"In this article, we study the horizontal scaling of the Waterfall network or similar blockDAG networks by applying hierarchical and graph-based clustering algorithms to partition them into subnetworks. This results in a reduction of network load and an increase in potential performance parameters of the underlying protocol. We consider methods of topology construction, propose clustering algorithms, and perform a simulation of the partitioning of a network into subnetworks.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136034150","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}
Margarita Capretto, Martín Ceresa, Antonio Fernández Anta, Antonio Russo, César Sánchez
{"title":"Improving Blockchain Scalability with the Setchain Data-type","authors":"Margarita Capretto, Martín Ceresa, Antonio Fernández Anta, Antonio Russo, César Sánchez","doi":"10.1145/3626963","DOIUrl":"https://doi.org/10.1145/3626963","url":null,"abstract":"Blockchain technologies are facing a scalability challenge, which must be overcome to guarantee a wider adoption of the technology. This scalability issue is due to the use of consensus algorithms to guarantee the total order of the chain of blocks (and of the transactions within each block). However, total order is often not fully necessary, since important advanced applications of smart-contracts do not require a total order among all operations. A much higher scalability can potentially be achieved if a more relaxed order (instead of a total order) can be exploited. In this paper, we propose a novel distributed concurrent data type, Setchain , which significantly improves scalability. A Setchain implements a grow-only set whose elements are not ordered, unlike conventional blockchain operations. When convenient, the Setchain allows forcing a synchronization barrier that assigns permanently an epoch number to a subset of the latest elements added, agreed by consensus. Therefore, two operations in the same epoch are not ordered, while two operations in different epochs are ordered by their respective epoch number. We present different Byzantine-tolerant implementations of Setchain, prove their correctness and report on an empirical evaluation of a prototype implementation. Our results show that Setchain is orders of magnitude faster than consensus-based ledgers, since it implements grow-only sets with epoch synchronization instead of total order. Since the Setchain barriers can be synchronized with the underlying blockchain, Setchain objects can be used as a sidechain to implement many decentralized solutions with much faster operations than direct implementations on top of blockchains. Finally, we also present an algorithm that encompasses into a single process the combined behavior of the Byzantine servers, which simplifies correctness proofs by encoding the general attacker in a concrete implementation.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135856273","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}
Shlomi Linoy, Suprio Ray, Natalia Stakhanova, Erik Scheme
{"title":"Authenticated Range Querying of Historical Blockchain Healthcare Data using Authenticated Multi-Version Index","authors":"Shlomi Linoy, Suprio Ray, Natalia Stakhanova, Erik Scheme","doi":"10.1145/3624575","DOIUrl":"https://doi.org/10.1145/3624575","url":null,"abstract":"With growing adoption of blockchain in established and emerging applications, there is an increasing need to support efficient ad hoc querying of authenticated historical data. This is especially true in fields such as healthcare to meet the rigorous security and regulatory requirements of ever-expanding digital health platforms. Existing blockchain systems, however, offer little or no support for querying capabilities over historical data. Although a full blockchain archive node can be used to maintain historical records of all executed transactions on the chain, it is not scalable when dealing with large volumes of data. Moreover, such ‘offline’ historical data lack tamper evidence support. To address these issues, we introduce an authenticated index structure called Authenticated Multi-Version Skip List (AMVSL), designed to support a rich set of query features over historical blockchain data. We further present three range queries: SVRK, MVRK and MVAK, which offer querying over a range of keys and a range of versions. Our experimental evaluation of two healthcare-inspired examples demonstrates that AMVSL efficiently supports these queries and can achieve performance that is several orders of magnitude faster than existing authenticated data structures.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135347472","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}
{"title":"Accelerating Blockchain Applications on IoT Architecture Models - Solutions and Drawbacks","authors":"Roland Kromes, François Verdier","doi":"10.1145/3626200","DOIUrl":"https://doi.org/10.1145/3626200","url":null,"abstract":"More and more IoT use cases require trustworthy computing from cloud/back-end services, which cannot necessarily provide a fully trusted execution environment, data immutability, and traceability. The integration of IoT with the blockchain technology is one of the most promising solution to achieve the previously mentioned features in the IoT networks. Researchers are also interested in integration solutions and several solutions are already present in the scientific literature. However, there are still some uncertainties in establishing a direct and effective interaction between an IoT device and the given blockchain. In this work, we propose the first IoT hardware architecture model designed to accelerate time-consuming operations of IoT-Blockchain. The proposed IoT hardware architecture model is programmed in SystemC-TLM and can provide a significant reduction in execution time, 53% and 18% when running Hyperledger Sawtooth and Ethereum applications respectively.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135194172","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}
{"title":"VOTING IN DAOs","authors":"Nicola Dimitri","doi":"10.1145/3624574","DOIUrl":"https://doi.org/10.1145/3624574","url":null,"abstract":"In recent years the adoption of smart contracts, in blockchain platforms, has increased substantially. One of the main applications of smart contracts are the so called Decentralized Autonomous Organizations (DAO), which originated from an idea envisaged by Buterin, in his Ethereum white paper. Indeed, DAOs are decentralized organizations, where the members implement their decisions using smart contracts. In the paper we introduce a simple framework for a DAO, and then we discuss some governance issues. In particular, we focus on how DAO members could be induced to dedicate sufficient time to voting sessions, for a proper functioning of the organization. Indeed, recent empirical research suggests how the members’ participation rate, to voting activities, has a meaningful positive correlation with to a DAO's performance. More specifically, we formalize the notion of attention time and propose a simple model for the so-called Holographic Consensus, a protocol introduced by the DAOStack platform to solve the issue of limited time dedicated to governance, discussing under what conditions DAO members may choose the so-called boosting voting procedure.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136308218","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}
Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog
{"title":"Reality-based UTXO Ledger","authors":"Sebastian Müller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis, William Sanders, Hans Moog","doi":"10.1145/3616022","DOIUrl":"https://doi.org/10.1145/3616022","url":null,"abstract":"The Unspent Transaction Output (UTXO) model is commonly used in the field of Distributed Ledger Technology (DLT) to transfer value between participants. One of its advantages is that it allows parallel processing of transactions, as independent transactions can be added in any order. This property of order invariance and parallelisability has potential benefits in terms of scalability. However, since the UTXO Ledger is an append-only data structure, this advantage is compromised through the presence of conflicting transactions. We propose an extended UTXO Ledger model that optimistically updates the ledger and keeps track of the dependencies of the possible conflicts. In the presence of a conflict resolution mechanism, we propose a method to reduce the extended ledger back to a consistent UTXO Ledger.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135109343","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}
{"title":"ElectAnon: A Blockchain-based, Anonymous, Robust, and Scalable Ranked-choice Voting Protocol","authors":"Ceyhun Onur, Arda Yurdakul","doi":"10.1145/3598302","DOIUrl":"https://doi.org/10.1145/3598302","url":null,"abstract":"Remote voting has become more critical in recent years, especially since the COVID-19 outbreak. Blockchain technology and its benefits such as decentralization, security, and transparency have given rise to proposals for blockchain-based voting systems. However, the traceability of blockchain transactions violates voter anonymity in existing proposals. Besides, transaction costs also need to be considered. Solutions that may cause repeated elections should be avoided for a low-cost scalable voting system. In this work, we propose ElectAnon, a blockchain-based, self-tallying, and ranked-choice voting protocol focusing on anonymity, robustness, and scalability. ElectAnon achieves anonymity by enabling voters to register with identity commitments and cast their votes via zero-knowledge proofs. Robustness is realized by removing the direct control of the authorities in the voting process by using timed-state machines. Each voter encodes the ballot into a single integer and blinds the vote off-chain while making the verification on-chain. This makes the protocol infinitely scalable in the number of voters. ElectAnon is also a solution for governance in Decentralized Autonomous Organizations (DAO): It includes a candidate proposal module and an algorithm-agnostic mechanism to plug-in different tallying methods easily. The Merkle forest extension is proposed for conducting even more trustless elections. ElectAnon is implemented with smart contracts based on Ethereum Virtual Machine (EVM) and a zero-knowledge gadget, Semaphore. The implementation also includes two different sophisticated tallying methods, Borda Count and Tideman. Experimental results show that a 40-voter and 10-candidate election can be implemented with the gas consumption reduced up to 89% compared to previous works. While other studies could not exceed a 25,000-voter setup, ElectAnon has been observed to run safely for 1,000,000 voters. The implementation can be found at https://github.com/ceyonur/electanon .","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135109329","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}
{"title":"Smart Proofs via Recursive Information Gathering: Decentralized Refereeing by Smart Contracts","authors":"Sylvain Carré, Franck Gabriel, Clément Hongler, Gustavo Lacerda, Gloria Capano","doi":"10.1145/3595298","DOIUrl":"https://doi.org/10.1145/3595298","url":null,"abstract":"We introduce the SPRIG (Smart Proofs via Recursive Information Gathering) protocol. SPRIG allows agents to propose, question, and defend mathematical proofs in a decentralized fashion. A structure of stakes and bounties aims at producing debates in good faith and if those persist, they must go down to machine-level details, where they can be settled automatically. This combination of economic incentives and an oracle is designed to promote succinct and informative proofs. SPRIG can run autonomously as a smart contract on a blockchain platform, and hence it does not rely on a central trusted institution. We translate SPRIG into a general game-theoretic model and prove that the protocol satisfies two desirable properties: no spamming and monotonicity. We then characterize analytically the equilibrium of a simple two-player specification of the model: this provides important insights into the impact of the protocol’s parameters on the probabilities that it induces type I/II errors. We conclude by discussing the main attacks SPRIG’s designers will need to take into account.","PeriodicalId":470442,"journal":{"name":"Distributed Ledger Technologies Research and Practice","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135861378","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}