Follow blockchain research across journals, conferences, and preprint repositories.
1,300 results · page 50 of 55
Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos
No abstract is available for this record.
John Thomas, Pam Mantri
The blockchain revolution upholds the decentralizing ideal of “control nothing.” It is natural that such a pursuit would face issues of governance that demand reasonable control; control that is both operational as well as adaptive in nature. Eliminating middlemen and handing over controls to a trusted system of trustless agents does not thereby bestow trust across time. This is especially true when relentless change is the order of the day. Issues of governance rise up when blockchain systems (especially those that have embedded smart contracts) are forced to operate increasingly away from their original intent. Smart contracts need governance when beset with the problem of the unknown-unknowns. Guided by the axiomatic approach, this paper looks at the paradoxical issue of blockchain governance from a Complex Adaptive Systems (CAS) perspective that helps frame the fundamental problem of decentralization. The objective is to solve the Blockchain Governance Kernel Design. Real-life examples are used to illustrate the findings.
David Mendes, Irene Pimenta Rodrigues, César Fonseca, Manuel José Lopes · 6 authors
We introduce our solution developed for data privacy, and specifically for cognitive security that can be enforced and guaranteed using blockchain technology in SAAL (Smart Ambient Assisted Living) environments. Personal clinical and demographic information segments to various levels that assures that it can only be rebuilt at the interested and authorized parties and no profiling can be extracted from the blockchain itself. Using our proposal the access to a patient's clinical process resists tampering and ransomware attacks that have recently plagued the HIS (Hospital Information Systems) in various countries. The core of the blockchain model assures non-repudiation possible by any of the involved information producers thus maintaining ledger fidelity of the enclosed historical process information. One important side effect of this data infrastructure is that it can be accessed in open form, for research purposes for instance, since no individual re-identification or group profiling is possible by any means.
Tuyet Duong
Cryptocurrencies like Bitcoin have proven to be a phenomenal success. The underlying techniques hold huge promise to change the future of financial transactions, and eventually the way people and companies compute, collaborate, and interact. At the same time, the current Bitcoin-like proof-of-work based blockchain systems are facing many challenges. In more detail, a huge amount of energy/electricity is needed for maintaining the Bitcoin blockchain. In addition, their security holds if the majority of the computing power is under the control of honest players. However, this assumption has been seriously challenged recently and Bitcoin-like systems will fail when this assumption is broken. This research proposes novel blockchain designs to address the challenges. We first propose a novel blockchain protocol, called 2-hop blockchain, by combining proof-of-work and proof-of-stake mechanisms. That said, even if the adversary controls more than 50% computing power, the honest players still have the chance to defend the blockchain via honest stake. Then we revise and implement the design to obtain a practical cryptocurrency system called Twinscoin. In more detail, we introduce a new strategy for difficulty adjustment in the hybrid blockchain and provide an analysis of it. We also show how to construct a light client for proof-of-stake cryptocurrencies and evaluate the proposal practically. We implement our new design. Our implementation uses a recent modular development framework for blockchains, called Scorex. It allows us to change only certain parts of an application leaving other codebase intact.
Jonathan Taylor Heinecke
Distributed ledger technologies (DLTs) are currently dominating the field of distributed systems research and development. The Ethereum blockchain is emerging as a popular DLT platform for developing software and applications. Several challenges in Ethereum software development are the complex nature of working with DLTs, the lack of tools for developing on this DLT, and poor documentation of concepts for DLT developers. In this thesis, we provide building blocks that reduce the complexity of DLT operations and lower the barrier to entry into DLT development. We do this by providing a Node.js library, Ethereum-Easy, that simplifies operations on Ethereum. We implement this library into a sample application called Rock, Paper, Scissors (RPS) and built a continuous delivery, continuous integration pipeline for deploying Ethereum code (Jenk-Thereum). This thesis aims to make development on DLTs easier, quicker, and less expensive.
Mohammad Hossein Manshaei, Murtuza Jadliwala, Anindya Maiti, Mahdi Fooladgar
Low transaction throughput and poor scalability are significant issues in public blockchain consensus protocols such as Bitcoins. Recent research efforts in this direction have proposed shard-based consensus protocols where the key idea is to split the transactions among multiple committees (or shards), which then process these shards or set of transactions in parallel. Such a parallel processing of disjoint sets of transactions or shards by multiple committees significantly improves the overall scalability and transaction throughout of the system. However, one significant research gap is a lack of understanding of the strategic behavior of rational processors within committees in such shard-based consensus protocols. Such an understanding is critical for designing appropriate incentives that will foster cooperation within committees and prevent free-riding. In this paper, we address this research gap by analyzing the behavior of processors using a game-theoretic model, where each processor aims at maximizing its reward at a minimum cost of participating in the protocol. We first analyze the Nash equilibria in an N-player static game model of the sharding protocol. We show that depending on the reward sharing approach employed, processors can potentially increase their payoff by unilaterally behaving in a defective fashion, thus resulting in a social dilemma. In order to overcome this social dilemma, we propose a novel incentive-compatible reward sharing mechanism to promote cooperation among processors. Our numerical results show that achieving a majority of cooperating processors (required to ensure a healthy state of the blockchain network) is easier to achieve with the proposed incentive-compatible reward sharing mechanism than with other reward sharing mechanisms.
Thach Ngoc Nguyen, Christian Servín, Владик Крейнович
Nowadays, most financial transactions are based on a centralized system, when all the transaction records are stored in a central location. This centralization makes the financial system vulnerable to cyber-attacks. A natural way to make the financial system more robust and less vulnerable is to switch to decentralized currencies. Such a transition will also make financial system more transparent. Historically first currency of this type -- bitcoin -- use a large amount of electric energy to mine new coins and is, thus, not scalable to the level of financial system as a whole. A more realistic and less energy-consuming scheme is provided by proof-of-stake currencies, where the right to mint a new coin is assigned to a randomly selected user, with probability depending of the user's stake (e.g., his/her number of coins). What probabilities should we choose? In this paper, we find the probability selection that provides the optimal result -- optimal in the sense that it is the least inductive to cheating.
Waqas Mahmood, Abdul Wahab
Distributed ledger technology has gained wide popularity and adoption since the emergence of bitcoin in 2008 which is based on proof of work (PoW). It is a distributed, transparent and immutable database of records of all the transactions or events that have been shared and executed among the participants. All the transactions are verified and maintained by multiple nodes across a network without a central authority through a distributed cryptographic mechanism, a consensus protocol. It forms the core of this technology that not only validates the information appended to the ledger but also ensures the order in which it is appended across all the nodes. It is the foundation of its security, accountability and trust. While many researchers are working on improving the current protocol to be quantum resistant, fault-tolerant, and energy-efficient. Others are focused on developing different variants of the protocol, best suited for specific use cases. In this paper, we shall review different consensus protocols of distributed ledger technologies and their implementations. We shall also review their properties, concept and similar-work followed by a brief analysis.
Qi Zhang, Petr Novotny, Salman Baset, Donna N. Dillenberger · 6 authors
The rise of crypto-currencies has spawned great interest in their underlying technology, namely, Blockchain. The central component in a Blockchain is a shared distributed ledger. A ledger comprises series of blocks, which in turns contains a series of transactions. An identical copy of the ledger is stored on all nodes in a blockchain network. Maintaining ledger integrity and security is one of the crucial design aspects of any blockchain platform. Thus, there are typically built-in validation mechanisms leveraging cryptography to ensure the validity of incoming blocks before committing them into the ledger. However, a blockchain node may run over an extended period of time, during which the blocks on the disk can may become corrupted due to software or hardware failures, or due to malicious activity. This paper proposes LedgerGuard, a tool to maintain ledger integrity by detecting corrupted blocks and recovering these blocks by synchronizing with rest of the network. The experimental implementation of LedgerGuard is based on Hyperledger Fabric, which is a popular open source permissioned blockchain platform.
Craig Calcaterra, Wulf A. Kaal
No abstract is available for this record.
Pietro Marchionni
No abstract is available for this record.
Michel Rauchs, Andrew Glidden, Brian Gordon, Gina Pieters · 8 authors
The DLT ecosystem is plagued with the use of incomplete and inconsistent definitions and a lack of standardised terminology, creating a needlessly complicated landscape for everyone from experienced policymakers and developers to individuals venturing into the field for the first time. This study sets out to contribute to international discussions to create a shared, common language around DLT systems to clarify terminology and concepts.
Bernardo David, Peter Gaži, Aggelos Kiayias, Alexander Russell
No abstract is available for this record.
George Pîrlea, Ilya Sergey
We present the first formalisation of a blockchain-based distributed consensus protocol with a proof of its consistency mechanised in an interactive proof assistant.
Jong‐Hyouk Lee
Blockchain technology has been known as the underlying technology of cryptocurrencies, but nowadays it is further considered as a functional technology for improving existing technologies and creating new applications previously never practical. In this paper, we are focused on utilizing blockchain technology to introduce a new ID as a service (IDaaS) for digital identity management. The proposed blockchain-based ID as a service (BIDaaS) is explained with one practical example that shows how the proposed BIDaaS works as an identity and authentication management infrastructure for mobile users of a mobile telecommunication company.
Shehar Bano, Alberto Sonnino, Mustafa Al-Bassam, Sarah Azouvi · 7 authors
The blockchain initially gained traction in 2008 as the technology underlying bitcoin, but now has been employed in a diverse range of applications and created a global market worth over $150B as of 2017. What distinguishes blockchains from traditional distributed databases is the ability to operate in a decentralized setting without relying on a trusted third party. As such their core technical component is consensus: how to reach agreement among a group of nodes. This has been extensively studied already in the distributed systems community for closed systems, but its application to open blockchains has revitalized the field and led to a plethora of new designs. The inherent complexity of consensus protocols and their rapid and dramatic evolution makes it hard to contextualize the design landscape. We address this challenge by conducting a systematic and comprehensive study of blockchain consensus protocols. After first discussing key themes in classical consensus protocols, we describe: first protocols based on proof-of-work (PoW), second proof-of-X (PoX) protocols that replace PoW with more energy-efficient alternatives, and third hybrid protocols that are compositions or variations of classical consensus protocols. We develop a framework to evaluate their performance, security and design properties, and use it to systematize key themes in the protocol categories described above. This evaluation leads us to identify research gaps and challenges for the community to consider in future research endeavours.
Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou
In his PODC’2017 keynote address, Maurice Herlihy pointed out that despite the hype about blockchains and distributed ledgers, no formal abstraction of these objects has been proposed. To face this issue, in this paper we provide a proper formulation of a distributed ledger object. In brief, we define a ledger object as a sequence of records, and we provide the operations and the properties that such an object should support. We then provide a variation of the ledger – the validated ledger – which requires that each record in the ledger satisfies a particular validation rule. A (validated) ledger is distributed if it is implemented on top of multiple (possibly geographically dispersed) computing devices.
Marco Baldi, Franco Chiaraluce
Decentralized digital currency systems known as cryptocurrencies are a breakthrough in electronic payments: the absence of a central authority can avoid the risk that a not fully reliable government seizes assets or causes hyperinflation, very small transactions can be made without incurring high costs and transactions can be traced, thus providing a tool to counter laundering and tax evasion. Furthermore, decentralization provides robustness against many attacks. Despite these advantages, cryptocurrencies have still not become mainstream solutions, because of scarce users’ inclination to adopt them as a privileged payment tool. This is mostly due to the absence of a structured form of control, which also prevents from having some credit insurance. Moreover, some present and future attacks, like quantum computer-based attacks, may threaten their security. In this paper we define new technical solutions to allow cryptocurrencies to become trusted tools for secure and verifiable digital transactions, and also for deposits, while preserving decentralization and users’ privacy. Based on a thorough security analysis, a new cryptocurrency model is first defined, exploiting a set of secure and post-quantum cryptographic primitives. Then, a secure supervision and authentication network is designed, which allows to control transactions, while guaranteeing users’ privacy. A robust reputation system for this context is also proposed, which helps to increase users’ trust and to reduce misconduct.
Russell O'Connor
Simplicity is a typed, combinator-based, functional language without loops and recursion, designed to be used for crypto-currencies and blockchain applications. It aims to improve upon existing crypto-currency languages, such as Bitcoin Script and Ethereum's EVM, while avoiding some of the problems they face. Simplicity comes with formal denotational semantics defined in Coq, a popular, general purpose software proof assistant. Simplicity also includes operational semantics that are defined with an abstract machine that we call the Bit Machine. The Bit Machine is used as a tool for measuring the computational space and time resources needed to evaluate Simplicity programs. Owing to its Turing incompleteness, Simplicity is amenable to static analysis that can be used to derive upper bounds on the computational resources needed, prior to execution. While Turing incomplete, Simplicity can express any finitary function, which we believe is enough to build useful ``smart contracts'' for blockchain applications.
Giulio Malavolta, Pedro Moreno-Sánchez, Aniket Kate, Matteo Maffei · 5 authors
Permissionless blockchains protocols such as Bitcoin are inherently limited in transaction throughput and latency. Current efforts to address this key issue focus on off-chain payment channels that can be combined in a Payment-Channel Network (PCN) to enable an unlimited number of payments without requiring to access the blockchain other than to register the initial and final capacity of each channel. While this approach paves the way for low latency and high throughput of payments, its deployment in practice raises several privacy concerns as well as technical challenges related to the inherently concurrent nature of payments that have not been sufficiently studied so far. In this work, we lay the foundations for privacy and concurrency in PCNs, presenting a formal definition in the Universal Composability framework as well as practical and provably secure solutions. In particular, we present Fulgor and Rayo. Fulgor is the first payment protocol for PCNs that provides provable privacy guarantees for PCNs and is fully compatible with the Bitcoin scripting system. However, Fulgor is a blocking protocol and therefore prone to deadlocks of concurrent payments as in currently available PCNs. Instead, Rayo is the first protocol for PCNs that enforces non-blocking progress (i.e., at least one of the concurrent payments terminates). We show through a new impossibility result that non-blocking progress necessarily comes at the cost of weaker privacy. At the core of Fulgor and Rayo is Multi-Hop HTLC, a new smart contract, compatible with the Bitcoin scripting system, that provides conditional payments while reducing running time and communication overhead with respect to previous approaches. Our performance evaluation of Fulgor and Rayo shows that a payment with 10 intermediate users takes as few as 5 seconds, thereby demonstrating their feasibility to be deployed in practice.
Stefano De Angelis, Leonardo Aniello, Roberto Baldoni, Federico Lombardi · 6 authors
Permissioned blockchains are arising as a solution to federate companies prompting accountable interactions. A variety of consensus algorithms for such blockchains have been proposed, each of which has dierent benets and drawbacks. Proof-of-Authority (PoA) is a new family of Byzantine fault-tolerant (BFT) consensus algorithms largely used in practice to ensure better performance than traditional Practical Byzantine Fault Tolerance (PBFT). However, the lack of adequate analysis of PoA hinders any cautious evaluation of their eectiveness in real-world permissioned blockchains deployed over the Internet, hence on an eventually synchronous network experimenting Byzantine nodes.<br> In this paper, we analyse two of the main PoA algorithms, named Aura and Clique, both in terms of provided guarantees and performances. First, we derive their functioning including how messages are exchanged, then we weight, by relying on the CAP theorem, consistency, availability and partition tolerance guarantees. We also report a qualitative latency analysis based on message rounds. The analysis advocates that PoA for per-missioned blockchains, deployed over the Internet with Byzantine nodes, do not provide<br> adequate consistency guarantees for scenarios where data integrity is essential. We claim that PBFT can t better such scenarios, despite a limited loss in terms of performance.
Ben van Lier
Abstract A blockchain can be considered a technological phenomenon that is made up of different interconnected and autonomous systems. Such systems are referred to here as cyber‐physical systems: complex interconnections of cyber and physical components. When cyber‐physical systems are interconnected, a new whole consisting of a system of systems is created by the autonomous systems and their intercommunication and interaction. In a blockchain, individual systems can independently make decisions on joint information transactions. The decision‐making procedures needed for this are executed based on fault‐tolerant communication and voting and consensus procedures, while the results of these decision‐making procedures are stored in distributed ledgers. Due to the intercommunication, interaction, and independent decision making by autonomous systems, the new whole of a blockchain is a complex entity. Complexity science rather than the usual reductionist scientific approach can help us better understand the behaviour of the new and continuously developing whole of a blockchain as a technological phenomenon.
Michael A. Walker, Abhishek Dubey, Áron Lászka, Douglas C. Schmidt
With the advent of blockchain-enabled IoT applications, there is an increased\nneed for related software patterns, middleware concepts, and testing practices\nto ensure adequate quality and productivity. IoT and blockchain each provide\ndifferent design goals, concepts, and practices that must be integrated,\nincluding the distributed actor model and fault tolerance from IoT and\ntransactive information integrity over untrustworthy sources from blockchain.\nBoth IoT and blockchain are emerging technologies and both lack codified\npatterns and practices for development of applications when combined. This\npaper describes PlaTIBART, which is a platform for transactive IoT blockchain\napplications with repeatable testing that combines the Actor pattern (which is\na commonly used model of computation in IoT) together with a custom Domain\nSpecific Language (DSL) and test network management tools. We show how\nPlaTIBART has been applied to develop, test, and analyze fault-tolerant IoT\nblockchain applications.\n
Alysson Bessani, João Sousa, Marko Vukolić
Hyperledger Fabric (HLF) is a flexible permissioned blockchain platform designed for business applications beyond the basic digital coin addressed by Bitcoin and other existing networks. A key property of HLF is its extensibility, and in particular the support for multiple ordering services for building the blockchain. Nonetheless, the version 1.0 was launched in early 2017 without an implementation of a Byzantine fault-tolerant (BFT) ordering service. To overcome this limitation, we designed, implemented, and evaluated a BFT ordering service for HLF on top of the BFT-SMaRt state machine replication/consensus library, implementing also optimizations for wide-area deployment. Our results show that HLF with our ordering service can achieve up to ten thousand transactions per second and write a transaction irrevocably in the blockchain in half a second, even with peers spread in different continents.