Online and offline storage of digital currency present conflicting risks for a Bitcoin exchange. While bitcoins stored on online devices are continually vulnerable to malware and other network-based attacks, offline reserves are endangered on access, as transferring bitcoins requires the exposure of otherwise encrypted and secured private keys. In particular, fluctuations in customer demand for deposited bitcoin require exchanges to periodically refill online storage systems with bitcoins held offline. This raises the natural question of what upper limit on online reserves minimizes losses due to theft over time. In this article, we investigate this optimization problem, developing a model that predicts the optimal ceiling on online reserves, given average rates of deposits, withdrawals, and theft. We evaluate our theory with an event-driven simulation of the setup, and find that our equation yields a numerical value for the threshold that differs by less than 2% from experimental results. We conclude by considering open questions regarding more complex storage architectures.
The recent emergence of a distributed technology named blockchain, clearly created a new point of view in the data storing and data distribution fields. If on one hand blockchain is mainly known for Bitcoin (an auto-regulated decentralized digital currency), on the other hand it has the potential to set up an auto regulated economy.In this thesis, the blockchain technology will be analyzed and described starting from P2P architecture and its origin in 2009 Satoshi Nakamotoâs whitepaper, and leading to the most up to date blockchains. The advantages and disadvantages of such architecture will be pointed out keeping in mind the security, speed and cost of such infrastructure.While Real Estate companies have often anticipated the technological innovations, land registries, instead, derive and keep a working manner which is extremely old and out of date: made of unclear procedures and wet signatures. The market needs and legislation will be researched mainly referring to other works and integrated with a technical point of view with particular focus on the decentralization of such systems.After analyzing the flow, problems and flaws of the current system, a new proposal will be researched, in particular trying to minimize the dead time in between the diïŹerent steps of the mortgage, increase transparency, as well as reducing dependence on the central authorities, leading to more convenient interactions among the propertiesâ stakeholders. An attractive low capitalization decentralized financial product will also be proposed and implemented able to lower the interest rate and create a profitable investment with low risk, low interest and durable in time.Secure and ad-hoc algorithms will be presented and, in a later section, analyzed in combination with diïŹerent blockchain technologies. Scalability and performance will also be evaluated, taking into account all the current technology limitations and the near future opportunities.
This thesis is one in a group of several theses that are researching different subjects in the development of a new cryptocurrency. For a few years now, the cryptocurrency market has grown dramatically, in the lead of the original cryptocurrency Bitcoin. Today, most cryptocurrencies' validation-technology, including Bitcoin's, are based on Proof-of-Work (PoW), i.e., a system where transaction validation is made by servers calculating mathematical problems. PoW results in high energy consumption and slow transaction speed. In this cryptocurrency, the validation mechanism will build on a technology called Proof-of-Stake (PoS). PoS does not yield as high energy consumption and often leads to faster transaction speed. The specific technique for validation in this system is that validators bet their coins to validate transactions and get rewards in the form of transaction fees if they end up conforming the transactions that reach consensus among the validators. In particular, the purpose of this report is to research the risk and reward for validators in the betting process and from this develop a reward policy which yields a fast and secure validation. The methods used for solving the problems are simulations based on Monte Carlo methods. From the simulations, the results are discussed and compared. Also, this report will cover economic theories behind cryptocurrencies, mainly focusing on monetary policy and the transaction markets. The findings of this report are several risk functions for different topologies and winning conditions considered during the development of the cryptocurrency. Further, a conclusion was that the expected value of profit for validators need to be constant, independent of when the bets are made with regard to previous bets. From this, a reward function which distributes rewards between winning validators was formed. Another, economical conclusion from this was that, in the long run, the expected value of profit of betting should converge to zero due to a perfect competition market.
Adoption of Cryptocurrency has grown significantly over the time and becoming more popular among young generation. People are calling it currency of new digital era. In this research work we are reviewing the dominant Cryptocurrency systems and its underlying disruptive Innovations and Technologies.
IPFS [1] is a peer-to-peer version controlled filesystem that synthesizes learnings from many previous successful systems. IPFS combines a distributed Hash table, an incentivized block exchange, and a self-certifying namespace [1]. IPFS is a peer-to-peer hypermedia protocol to make the web faster, safer, and more open. According to the characteristics of IPFS, we propose an improved P2P file system scheme based on IPFS and Blockchain. We address the high-throughput problem for individual users in IPFS by introducing the role of content service providers. Consider data reliability and availability, storage overhead and other issues for service providers, we provide a novel zigzag-based storage model to improve the block storage model that IPFS provides. Moreover, we introduce blockchain to combine IPFS with this storage model. According to analysis, this proposed scheme can effectively solve the above problems.
Abstract Blockchain technology may have transformational potential for those music industries associated with recorded music, and for the sustainability of music careers. While predictions of widespread disintermediation may have been premature, blockchain technology does appear to have the potential to transform the role of third parties and to make musiciansâ careers more sustainable. Blockchains could improve the accuracy and availability of copyright data, facilitate nearâinstant micropayments for royalties, and significantly improve the transparency of the value chain.
A developing field of interest for the distributed systems and applied cryptography community is that of smart contracts: self-executing financial instruments that synchronize their state, often through a blockchain. One such smart contract system that has seen widespread practical adoption is Ethereum, which has grown to secure approximately 30 billion USD of currency value and in excess of 300,000 daily transactions. \n \nUnfortunately, the rise of these technologies has been marred by a repeated series of security vulnerabilities and high pro file contract failures. To address these failures, the Ethereum community has turned to formal verification and program analysis which show great promise due to the computational simplicity and bounded-time execution inherent to smart contracts. Despite this, no fully formal, rigorous, comprehensive, and executable semantics of the EVM (Ethereum Virtual Machine) currently exists, leaving a lack of rigor on which to base such tools. \n \nIn this work, we present KEVM, the first fully executable formal semantics of the EVM, the bytecode language in which smart contracts are executed. We create this semantics in a framework for executable \nsemantics, the K framework. We show that our semantics not only passes the official 40,683-test stress test suite for EVM implementations, but also reveals ambiguities and potential sources of error in the existing \non-paper formalization of EVM semantics on which our work is based. \n These properties make KEVM an ideal formal reference implementation against which other implementations can be evaluated. \n \nWe proceed to argue for a semantics-first formal verification approach for EVM contracts, and demonstrate its practicality by using KEVM to verify practically important properties over the arithmetic operation of an \nexample smart contract and the correct operation of a token transfer function in a second contract. We show that our approach is feasible and not computationally restrictive. We hope that our work serves as the base for the development of a wide range of useful formally derived tools for Ethereum, including model checkers, certified compilers, and program equivalence checkers.
Bitcoin, a protocol for a new permissionless decentralized digital currency hailed the arrival of a new application domain for computer science. Following Bitcoin's arrival, a series of innovations derived from the state of the art in several fields has been applied to cryptocurrencies, and has been slowly reshaping monetary and financial instruments on public distributed ledgers. It was soon clear however that Bitcoin and similar cryptocurrencies still require additional improvements. This challenging domain presents researchers in the field with new and exciting questions. I provide examples from two main research threads, related to the scalability of the protocol and to its underlying incentives.
Andrew Miller, Iddo Bentov, Surya Bakshi, Ranjit Kumaresan · 5 authors
Bitcoin, Ethereum and other blockchain-based cryptocurrencies, as deployed today, cannot scale for wide-spread use. A leading approach for cryptocurrency scaling is a smart contract mechanism called a payment channel which enables two mutually distrustful parties to transact efficiently (and only requires a single transaction in the blockchain to set-up). Payment channels can be linked together to form a payment network, such that payments between any two parties can (usually) be routed through the network along a path that connects them. Crucially, both parties can transact without trusting hops along the route. In this paper, we propose a novel variant of payment channels, called Sprites, that reduces the worst-case "collateral cost" that each hop along the route may incur. The benefits of Sprites are two-fold. 1) In Lightning Network, a payment across a path of $\ell$ channels requires locking up collateral for $Î(\ellÎ)$ time, where $Î$ is the time to commit an on-chain transaction. Sprites reduces this cost to $O(\ell + Î)$. 2) Unlike prior work, Sprites supports partial withdrawals and deposits, during which the channel can continue to operate without interruption. In evaluating Sprites we make several additional contributions. First, our simulation-based security model is the first formalism to model timing guarantees in payment channels. Our construction is also modular, making use of a generic abstraction from folklore, called the "state channel," which we are the first to formalize. We also provide a simulation framework for payment network protocols, which we use to confirm that the Sprites construction mitigates against throughput-reducing attacks.
Andrew Miller, Iddo Bentov, Ranjit Kumaresan, Christopher Cordi · 5 authors
Bitcoin, Ethereum and other blockchain-based cryptocurrencies, as deployed\ntoday, cannot scale for wide-spread use. A leading approach for cryptocurrency\nscaling is a smart contract mechanism called a payment channel which enables\ntwo mutually distrustful parties to transact efficiently (and only requires a\nsingle transaction in the blockchain to set-up). Payment channels can be linked\ntogether to form a payment network, such that payments between any two parties\ncan (usually) be routed through the network along a path that connects them.\nCrucially, both parties can transact without trusting hops along the route.\n In this paper, we propose a novel variant of payment channels, called\nSprites, that reduces the worst-case "collateral cost" that each hop along the\nroute may incur. The benefits of Sprites are two-fold. 1) In Lightning Network,\na payment across a path of $\\ell$ channels requires locking up collateral for\n$\\Theta(\\ell\\Delta)$ time, where $\\Delta$ is the time to commit an on-chain\ntransaction. Sprites reduces this cost to $O(\\ell + \\Delta)$. 2) Unlike prior\nwork, Sprites supports partial withdrawals and deposits, during which the\nchannel can continue to operate without interruption.\n In evaluating Sprites we make several additional contributions. First, our\nsimulation-based security model is the first formalism to model timing\nguarantees in payment channels. Our construction is also modular, making use of\na generic abstraction from folklore, called the "state channel," which we are\nthe first to formalize. We also provide a simulation framework for payment\nnetwork protocols, which we use to confirm that the Sprites construction\nmitigates against throughput-reducing attacks.\n
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times, always without real concurrency. First, all smart contracts are serially executed by miners before appending them to the blockchain. Later, those contracts are serially re-executed by validators to verify that the smart contracts were executed correctly by miners. Serial execution limits system throughput and fails to exploit today's concurrent multicore and cluster architectures. Nevertheless, serial execution appears to be required: contracts share state, and contract programming languages have a serial semantics. This paper presents a novel way to permit miners and validators to execute smart contracts in parallel, based on techniques adapted from software transactional memory. Miners execute smart contracts speculatively in parallel, allowing non-conflicting contracts to proceed concurrently, and "discovering" a serializable concurrent schedule for a block's transactions, This schedule is captured and encoded as a deterministic fork-join program used by validators to re-execute the miner's parallel schedule deterministically but concurrently. Smart contract benchmarks run on a JVM with ScalaSTM show that a speedup of of 1.33x can be obtained for miners and 1.69x for validators with just three concurrent threads.
Smart contracts are full-fledged programs that run on blockchains (e.g., Ethereum, one of the most popular blockchains). In Ethereum, gas (in Ether, a cryptographic currency like Bitcoin) is the execution fee compensating the computing resources of miners for running smart contracts. However, we find that under-optimized smart contracts cost more gas than necessary, and therefore the creators or users will be overcharged. In this work, we conduct the first investigation on Solidity, the recommended compiler, and reveal that it fails to optimize gas-costly programming patterns. In particular, we identify 7 gas-costly patterns and group them to 2 categories. Then, we propose and develop GASPER, a new tool for automatically locating gas-costly patterns by analyzing smart contracts' bytecodes. The preliminary results on discovering 3 representative patterns from 4,240 real smart contracts show that 93.5%, 90.1% and 80% contracts suffer from these 3 patterns, respectively.
With the increasing popularity of virtual currencies, it has become more important to have highly secure devices in which to store private-key information. Furthermore, ARM has made available an extension of processors architectures, designated TrustZone, which allows for the separation of trusted and non-trusted environments, while ensuring the integrity of the OS code. In this paper, we propose the exploitation of this technology to implement a flexible and reliable bitcoin wallet that is more resilient to dictionary and side-channel attacks. Making use of the TrustZone comes with the downside that writing and reading operations become slower, due to the encrypted storage, but we show that cryptographic operations can in fact be executed more efficiently as a result of platform-specific optimizations.
Decentralized trusted timestamping based on blockchains is used to protect a large variety of digital data. At present, in the case of trusted timestamping services, such related information is not included in the OP_RETURN field of a Bitcoin's transaction chain, which has a limited size (40 bytes). When OP_RETURN is extended, (e.g., with multiple OP_RETURN fields) the transaction is rejected by the Bitcoin network. We propose storing data in the blockchain by encoding into Bitcoin addresses. The transactions created by the proposed method are similar to the usual transactions; therefore, they will not be rejected. The proposed method expands the storage space to a maximum of N*20 bytes, thereby enabling the storage of additional information (e.g., file names, creator names, and keywords) as well as file hashes. We performed experiments with a picture and its copyright information. We set N =3, resulting in storage of 60 bytes of data. The experimental results indicate that the proposed method can timestamp a file in an average of 24 min at a possible cost of 0.24 USD. We believe that the proposed method can prove the existence and integrity of a digital file, which is helpful in copyright protection.
The Hyperledger Project is a Linux Foundation initiative to develop an open source ecosystem of blockchain development. The Linux Foundation aims to create an environment in which communities of software developers and companies meet and coordinate to build blockchain frameworks. Hyperledger itself is not another cryptocurrency, but rather an open hub for enterprise-grade blockchain projects to incubate and mature through all stages of development and commercialization. In this chapter, we talk about the current state of the Hyperledger Project, with a focus on the currently incubating projects, a summary of the project scope being implemented, and a review of the comprehensive set of technologies involved in creating an open source enterprise-grade blockchain.
Bitcoin relies on the Unspent Transaction Outputs (UTXO) \nset to efficiently verify new generated transactions. Every unspent output, \nno matter its type, age, value or length is stored in every full node. \nIn this paper we introduce a tool to study and analyze the UTXO set, \nalong with a detailed description of the set format and functionality. Our \nanalysis includes a general view of the set and quantifies the difference \nbetween the two existing formats up to the date. We also provide an accurate \nanalysis of the volume of dust and unprofitable outputs included \nin the set, the distribution of the block height in which the outputs where \nincluded, and the use of non-standard outputs.
Decentralized enactment of workflows is generally advocated for data intensive scientific applications. This approach offers a number of advantages including avoiding a single (centralized) point of failure, and associated (centralized) performance bottlenecks. However, such services are often assumed to be openly available with little or no security. This is increasingly not the case. Instead organizations and the services they offer require autonomous ways of defining and enforcing their own access control policies supporting fine-grained authorization. Tackling such scenarios raises many issues regarding workflow definition, enactment and potential re-enactment. This research explores the issues related to security-oriented decentralized workflow definition and enactment. The solution is respectful of the need for autonomy of service providers and allows each participating service to define their own access control policies. We also show how different security delivery models can be supported leveraging the pulling and pushing of security credentials.
Ikuo Magaki, Moein Khazraee, Luis Vega Gutierrez, Michael Taylor
GPU and FPGA-based clouds have already demonstrated the promise of accelerating computing-intensive workloads with greatly improved power and performance. In this paper, we examine the design of ASIC Clouds, which are purpose-built datacenters comprised of large arrays of ASIC accelerators, whose purpose is to optimize the total cost of ownership (TCO) of large, high-volume chronic computations, which are becoming increasingly common as more and more services are built around the Cloud model. On the surface, the creation of ASIC clouds may seem highly improbable due to high NREs and the inflexibility of ASICs. Surprisingly, however, large-scale ASIC Clouds have already been deployed by a large number of commercial entities, to implement the distributed Bitcoin cryptocurrency system. We begin with a case study of Bitcoin mining ASIC Clouds, which are perhaps the largest ASIC Clouds to date. From there, we design three more ASIC Clouds, including a YouTube-style video transcoding ASIC Cloud, a Litecoin ASIC Cloud, and a Convolutional Neural Network ASIC Cloud and show 2-3 orders of magnitude better TCO versus CPU and GPU. Among our contributions, we present a methodology that given an accelerator design, derives Pareto-optimal ASIC Cloud Servers, by extracting data from place-and-routed circuits and computational fluid dynamic simulations, and then employing clever but brute-force search to find the best jointly-optimized ASIC, DRAM subsystem, motherboard, power delivery system, cooling system, operating voltage, and case design. Moreover, we show how data center parameters determine which of the many Pareto-optimal points is TCO-optimal. Finally we examine when it makes sense to build an ASIC Cloud, and examine the impact of ASIC NRE.
The past five years have seen the rise of the Bitcoin digital currency and, as a result, increased discussion of the idea of a digital currency. This paper seeks to address Bitcoin in several contexts, viewing it as representative of the broader state of the digital currency debate. Through an analysis of several of the most important factors shaping Bitcoinâs existence, this essay develops and defends the assertion that Bitcoin will not achieve widespread adoption in the United States, and in all likelihood will fail to do so throughout the rest of the world as well. In light of this hypothesized downfall, this paper discusses the considerably more viable potential for Bitcoin (and its underlying blockchain technology) to drive innovation in the financial sector and other industries.
Brendan Benshoof, Andrew Rosen, Anu G. Bourgeois, Robert W. Harrison
We present D3NS, a system to replace the current top level DNS system and certificate authorities, offering increased scalability, security and robustness. D3NS is based on a distributed hash table and utilizes a domain name ownership system based on the Bitcoin blockchain. It addresses previous criticism that a DHT would not suffice as a DNS replacement. D3NS provides solutions to current DNS vulnerabilities such as DDOS attacks, DNS spoofing and censorship by local governments. D3NS eliminates the need for certificate authorities by providing a decentralized authenticated record of domain name ownership. Unlike previous DNS replacement proposals, D3NS is reverse compatible with DNS and allows for incremental implementation within the current system.