2019 IEEE International Conference on Blockchain (Blockchain)最新文献_第6页

ArtChain: Blockchain-Enabled Platform for Art Marketplace ArtChain:基于区块链的艺术市场平台

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00068

Ziyuan Wang, Lin Yang, Qin Wang, Donghai Liu, Zhiyu Xu, Shigang Liu

{"title":"ArtChain: Blockchain-Enabled Platform for Art Marketplace","authors":"Ziyuan Wang, Lin Yang, Qin Wang, Donghai Liu, Zhiyu Xu, Shigang Liu","doi":"10.1109/Blockchain.2019.00068","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00068","url":null,"abstract":"Blockchain is an emerging technology that has the potential to revolutionize the global industry and create a trusted relationship in a multi-party business network. There are a number of practical use cases where blockchain has been applied. One specific area is the Art industry, where it is a natural fit in the way that art forensics and transactions are conducted, tracked and recorded. This motivates us to develop the ArtChain platform to assist the Art Industry. In this paper, we present ArtChain, which is an integrated trading system based on blockchain. It includes the front end, the back end, the services, the smart contract, the chain connection and the deployment scripts from the bottom to the top. To the best of our knowledge, this is the first deployed blockchain-enabled art trading platform in Australia. It provides a transparent yet privacy-preserving, and tamper-proof transaction history for registration, provenance, and traceability of art assets. Our objective analysis and evaluation show that the ArtChain platform is applicable and practical. For the interest of other researchers, our system implementation related resources are open-sourced on Github.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129061995","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}

引用次数: 30

Toward a Decentralized, Trust-Less Marketplace for Brokered IoT Data Trading Using Blockchain 使用区块链实现物联网数据交易的去中心化、无信任市场

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00053

Shaimaa Bajoudah, Changyu Dong, P. Missier

引用次数: 42

Token-Based Sharing Control for IPFS 基于令牌的IPFS共享控制

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00056

Shigenori Ohashi, Hiroki Watanabe, Tatsuro Ishida, Shigeru Fujimura, Atsushi Nakadaira, J. Kishigami

{"title":"Token-Based Sharing Control for IPFS","authors":"Shigenori Ohashi, Hiroki Watanabe, Tatsuro Ishida, Shigeru Fujimura, Atsushi Nakadaira, J. Kishigami","doi":"10.1109/Blockchain.2019.00056","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00056","url":null,"abstract":"Blockchains can now be used to distribute digital assets independent of specific organizations. One way to handle digital assets on a blockchain is through tokens. Tokens define chunks of data on a blockchain, allowing it to be distributed like virtual currency. However, storing all data related to digital assets in a token is difficult. Data is currently managed separately because storing a large amount of data in a blockchain can cause the ledger to grow large. When the management of data depends on a particular organization, the stability of the token's value depends on that particular organization. In this paper, we propose an organization-independent management method that combines a distributed content-addressable file system with a blockchain. Our proposed method places the data associated with the token and the access information to the token into the distributed content-addressable file system. As a result, the token associated with the data has the sharing control of the data stored in the distributed content-addressable file system, and a configuration independent of the specific contract is realized.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382827","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}

引用次数: 4

BeaconBlocks: Augmenting Proof-of-Stake with On-Chain Time Synchronization BeaconBlocks:增强链上时间同步的权益证明

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00055

Alexander Hartl, T. Zseby, J. Fabini

{"title":"BeaconBlocks: Augmenting Proof-of-Stake with On-Chain Time Synchronization","authors":"Alexander Hartl, T. Zseby, J. Fabini","doi":"10.1109/Blockchain.2019.00055","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00055","url":null,"abstract":"Blockchain protocols based on Proof-of-Stake (PoS) algorithms aim to provide an alternative to the energy-consuming Proof-of-Work mining procedure. Following a PoS algorithm, nodes have to agree on the miner next eligible to contribute a block and on the point in time he is allowed to broadcast it. The latter requirement raises to the need for synchronous clocks. In this paper we describe BeaconBlocks, a new scheme for constructing PoS protocols. A major difference to former work is incorporating time synchronization as an essential element of the protocol itself, gaining independence of the nodes' clocks and allowing the protocol to resist attacks on clock synchronization infrastructure. To this end, we describe both a mechanism for obtaining the correct time during node startup and for retaining synchronicity of estimated time during a node's lifetime. In contrast to prior work, our approach for miner selection exhibits an interleaved unslotted structure. We show that fairness is achieved when miners follow our scheme and we provide a discussion of attack possibilities, allowing developers to choose secure parameters when adopting the scheme.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116910420","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}

引用次数: 5

Traceability in Permissioned Blockchain 许可区块链中的可追溯性

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00045

Tatsuo Mitani, Akira Otsuka

引用次数: 25

Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation 使用安全多方计算的许可区块链上的首次公开发行(IPO)

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00021

Tzipora Halevi, Fabrice Benhamouda, Angelo De Caro, S. Halevi, C. Jutla, Yacov Manevich, Qi Zhang

{"title":"Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation","authors":"Tzipora Halevi, Fabrice Benhamouda, Angelo De Caro, S. Halevi, C. Jutla, Yacov Manevich, Qi Zhang","doi":"10.1109/Blockchain.2019.00021","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00021","url":null,"abstract":"In this work, we add secure multiparty computation capabilities to the permissioned blockchain architecture of Hyperledger Fabric, and use them to implement the clearing price mechanism for initial public offering (IPO). As with any blockchain, the core property in Fabric is that all peers must see the same ledger, so using confidential data on the ledger is a challenge. To address this challenge we use cryptographic secure multiparty computation (MPC), which requires that we integrate a few new mechanisms into the Fabric architecture. Specifically we need to let the peers access local information such as their respective secret keys, and also send messages to each other while executing smart contracts. We also had to add to Fabric a library that implements the required cryptographic tools, and to make that library accessible from the smart contracts. We demonstrated the effectiveness of this solution by using it to implement the clearing price mechanism for IPOs. We designed an efficient cryptographic protocol for the IPO clearing price mechanism, and used our integrated system to run it on Fabric. Although not fully optimized yet, the performance of the resulting implementation is more than fast enough for this particular application, ranging from 8 to 23 seconds to execute an IPO sale.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121424039","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}

引用次数: 14

TendrilStaller: Block Delay Attack in Bitcoin TendrilStaller:比特币的区块延迟攻击

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00010

Matthew Walck, Ke Wang, Hyong S. Kim

{"title":"TendrilStaller: Block Delay Attack in Bitcoin","authors":"Matthew Walck, Ke Wang, Hyong S. Kim","doi":"10.1109/Blockchain.2019.00010","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00010","url":null,"abstract":"We present TendrilStaller, an eclipse attack targeting at Bitcoin's peer-to-peer network. TendrilStaller enables an adversary to delay block propagation to a victim for 10 minutes. The adversary thus impedes the victim from getting the latest blockchain state. It only takes as few as one Bitcoin full node and two light weight nodes to perform the attack. The light weight nodes perform a subset of the functions of a full Bitcoin node. The attack exploits a recent block propagation protocol introduced in April 2016. The protocol prescribes a Bitcoin node to select 3 neighbors that can send new blocks unsolicited. These neighbors are selected based on their recent performance in providing blocks quickly. The adversary induces the victim to select 3 attack nodes by having attack nodes send valid blocks to the victim more quickly than other neighbors. For this purpose, the adversary deploys a handful of light weight nodes so that the adversary itself receives new blocks faster. The adversary then performs the attack to delay blocks propagated to the victim. We implement the attack on top of current default Bitcoin protocol We deploy the attack nodes in multiple locations around the globe and randomly select victim nodes. Depending on the round-trip time between the adversary and the victim, 50%-85% of the blocks could be delayed to the victim. We further show that the adoption of light weight nodes greatly increases the attack probability by 15% in average. Finally, we propose several countermeasures to mitigate this eclipse attack.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":" 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132095292","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}

引用次数: 8

Scalable Distributed Random Number Generation Based on Homomorphic Encryption 基于同态加密的可扩展分布式随机数生成

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00083

Thanh Nguyen-Van, Tuan Nguyen-Anh, TienTrien Le, Minh-Phuoc Nguyen-Ho, Tuong Nguyen-Van, Nhat-Quang Le, Khuong Nguyen-An

引用次数: 16

Fork Rate-Based Analysis of the Longest Chain Growth Time Interval of a PoW Blockchain 基于分叉率的PoW区块链最长链增长时间间隔分析

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00040

Yasukazu Aoki, N. Koshizuka, Hirotsugu Seike

{"title":"Fork Rate-Based Analysis of the Longest Chain Growth Time Interval of a PoW Blockchain","authors":"Yasukazu Aoki, N. Koshizuka, Hirotsugu Seike","doi":"10.1109/Blockchain.2019.00040","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00040","url":null,"abstract":"Nakamoto's consensus protocol, which is well known for its resistance to sybil attacks by using PoW (Proof of Work), enables us to build public blockchains, such as Bitcoin. In this protocol, miners seek to extend the longest chain by solving blockhash-based cryptographic puzzles and the required time is probabilistically determined. Therefore, the distribution of the time interval affects security, performance and applications which utilize the block height information. Some researchers assumed that the time follows an exponential distribution but this assumption requires that the blockchain network is fully synchronized. To overcome this unreal scenario, the bounded delay model, in which there is an upper bound for block propagation delay on the network, was proposed. However, it is difficult to calculate the upper bound without observing delay and bandwidth on real-world network links. To solve this problem, we proposed another method to analyze the distribution of the longest chain growth time interval by using the observed fork rate. We derived a closed-form lower bound for the CDF (Cumulative Distribution Function) of the time to update the global block height. We also obtained the Pearson distance which can be used as the metric to judge whether the network is approximately synchronous or not. Finally, we conducted network simulations for comparing our lower bound with the lower bound that is based on the bounded delay model. In numerical examples, we show how the block size affects these lower bounds.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114596277","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}

引用次数: 7

Smart Contract-Based Secured Business-to-Consumer Supply Chain Systems 基于智能合约的安全企业对消费者供应链系统

2019 IEEE International Conference on Blockchain (Blockchain) Pub Date : 2019-07-01 DOI: 10.1109/Blockchain.2019.00084

Feiyang Qu, Hisham M. Haddad, H. Shahriar

引用次数: 13