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

Ensuring Genuineness for Selectively Disclosed Confidential Data Using Distributed Ledgers: Applications to Rail Wayside Monitoring 使用分布式账本确保选择性披露机密数据的真实性:在铁路路旁监控中的应用

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

Matthias Lohr, Jonathan Hund, J. Jürjens, Steffen Staab

{"title":"Ensuring Genuineness for Selectively Disclosed Confidential Data Using Distributed Ledgers: Applications to Rail Wayside Monitoring","authors":"Matthias Lohr, Jonathan Hund, J. Jürjens, Steffen Staab","doi":"10.1109/Blockchain.2019.00072","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00072","url":null,"abstract":"In railway incidents, data from sensors installed on railway tracks can help finding the cause of the incident and identifying the responsible parties. Since the data collected may contain business-relevant information, it is usually treated as confidential by the companies collecting it. However, this data can only be considered as evidence if it can be proven that the data is genuine and unaltered, even if it is only accessible for involved companies in the first place. In this paper, we present an approach to ensure the genuineness of confidential railway measurement data using distributed ledgers and describe an approach for selectively sharing parts of the data without compromising confidentiality or the verifiability of genuineness. %We discuss the specific characteristics of rail wayside measurement data, existing approaches to ensure data genuineness and the necessary modifications to apply them to rail wayside measurement data. We also discuss how our approach can be generalized beyond the railway domain to show how distributed ledger-based approaches can be used to ensure the genuineness of confidential and selectively shared data.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"4 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":"132336441","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}

引用次数: 2

Formal Verification of Smart Contracts Using Interface Automata 使用接口自动机的智能合约的形式化验证

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

G. Madl, L. A. Bathen, G. H. Flores, D. Jadav

{"title":"Formal Verification of Smart Contracts Using Interface Automata","authors":"G. Madl, L. A. Bathen, G. H. Flores, D. Jadav","doi":"10.1109/Blockchain.2019.00081","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00081","url":null,"abstract":"Emerging distributed ledger technologies - also known as blockchains - have recently become a hot research topic across a wide variety of industries due to their immutability, availability, security, and more importantly, their ability to execute multi-party agreements or business rules in the form of smart contracts. Smart contracts provide the means to automate and enforce contractual terms between the parties entering the agreement. It is important to guarantee the correctness of such contracts in order to avoid catastrophic events that may require human intervention. This paper presents a method that builds on the interface automata model of computation as a semantic domain to formalize smart contracts. The formal model of computation assigns a precise and unambiguous meaning to smart contracts. Loyalty points are discounts and bonuses provided by companies with the purpose of retaining their loyal customers. The proposed method is evaluated in the context of a loyalty points marketplace. The decentralized, distributed and immutable nature of blockchain provides an appealing platform for the implementation of a loyalty points marketplace, and the formal semantics based on interface automata ensure that violations of the agreement can be detected, and contractual clauses can be enforced by all parties involved in loyalty points transactions.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"46 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":"124105435","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

Performance Analysis of a Hyperledger Fabric Blockchain Framework: Throughput, Latency and Scalability 超级账本结构区块链框架的性能分析:吞吐量、延迟和可扩展性

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

M. Kuzlu, M. Pipattanasomporn, Levent Gurses, S. Rahman

引用次数: 126

A Measurement Study of Bitcoin Lightning Network 比特币闪电网络的测量研究

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

Yuwei Guo, Jinfeng Tong, Chen Feng

引用次数: 20

Toward a Decentralized Marketplace for Self-Maintaining Machines 走向自我维护机器的去中心化市场

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

Daniel Miehle, Matthias M. Meyer, André Luckow, B. Bruegge, Michael Essig

{"title":"Toward a Decentralized Marketplace for Self-Maintaining Machines","authors":"Daniel Miehle, Matthias M. Meyer, André Luckow, B. Bruegge, Michael Essig","doi":"10.1109/Blockchain.2019.00066","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00066","url":null,"abstract":"Industrial procurement processes are inefficient, expensive, and error-prone as they require the agreement of numerous participants, audit-proof documentation, and are characterized by a high number of manual tasks. Blockchain technology has the potential to counter these challenges by combining peer-to-peer networks, cryptography, and consensus algorithms. A blockchain is a decentralized database that stores transactions and data transparently, chronologically, and tamper-proof in a distributed network. In this paper, we present a blockchain-based industrial marketplace, where machines have an identity and account for selecting, ordering, and paying materials in an automated manner using smart contracts. This allows manufacturers with a low real-net-output-ratio, such as car manufacturers that depend on numerous suppliers, to optimize their purchasing processes. Using our case study, we demonstrate prototypical implementation of the decentralized marketplace and its applications in the area of industrial maintenance. Furthermore, we conducted a semi-structured interview with procurement and information technology experts from the automotive industry. The results indicate that our prototype offers a promising approach streamlining procurement processes within the next two to five years.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"19 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":"117286311","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

Bitcoin Mining with Transaction Fees: A Game on the Block Size 用交易费挖比特币:关于区块大小的游戏

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

Suhan Jiang, Jie Wu

{"title":"Bitcoin Mining with Transaction Fees: A Game on the Block Size","authors":"Suhan Jiang, Jie Wu","doi":"10.1109/Blockchain.2019.00023","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00023","url":null,"abstract":"In a Bitcoin market, miners participate in blockchain mining with an aim to make profits. Until reaching consensus, PoW-valid blocks (including validated transactions and proper PoW solutions) can be viewed as being successfully mined and are rewarded. There are two types of rewards for miners: fixed block subsidies and time-varying transaction fees. Block subsidies, predetermined by design, are the current major revenue source. Transaction fees, offered by Bitcoin transaction senders to accelerate their transactions, heavily depend on the corresponding transaction size. Thus, a larger-size block tends to contain higher transaction fees and hence more rewards. However, the probability of a miner to successfully mine a block diminishes as the block size increases, since a larger-size block takes a longer time to reach consensus. Thus, the reward included in the block is vitally affected by its size, which is independently decided by a miner. In this paper, we use a game-theoretic approach to study how a miner's payoff, i.e., expected profits, is determined by his block size. More specifically, we derive an expression to characterize the relation between the miner's payoff and block sizes. Besides, we use game theory to analyze how profit-driven miners will manipulate their block sizes to optimize payoff instead of adopting the default block size. We conduct numerical experiments on real-world data collected from Bitcoin to find peaceful equilibrium where miners have no incentive to misbehave. The achieved block sizes thereby give guidelines on the default block size, in order to deter miners from misbehaving. Our analysis suggests a block size of 4 MB.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"130 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":"116565329","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}

引用次数: 19

FastChain: Scaling Blockchain System with Informed Neighbor Selection FastChain:基于知情邻居选择的区块链扩展系统

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

Ke Wang, Hyong S. Kim

引用次数: 18

Privacy-Preserving and Efficient Multi-Keyword Search over Encrypted Data on Blockchain 区块链上加密数据的隐私保护和高效多关键字搜索

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

Shan Jiang, Jiannong Cao, Julie A. McCann, Yanni Yang, Yang Liu, Xiaoqing Wang, Yuming Deng

{"title":"Privacy-Preserving and Efficient Multi-Keyword Search over Encrypted Data on Blockchain","authors":"Shan Jiang, Jiannong Cao, Julie A. McCann, Yanni Yang, Yang Liu, Xiaoqing Wang, Yuming Deng","doi":"10.1109/Blockchain.2019.00062","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00062","url":null,"abstract":"Recent research has demonstrated searchable blockchains that not only provide reliable search over encrypted distributed storage systems but ensure privacy is preserved. Yet, current solutions focus on single-keyword search over encrypted data on the blockchain. To extend such approaches to multi-keyword scenarios, they essentially perform a single-keyword search for multiple times and take the intersection of the results. However, such extensions suffer from privacy and efficiency issues. In particular, the service peers, which process the search requests, will be aware of the intermediate results, which include the data associated with each of the encrypted keywords. Moreover, these multiple traversals incur long delays in performing the search requests one after another with an extra cost in calculating the intersection of multiple sets. Finally, the service peers will charge the data owner a lot for writing the vast intermediate results to the smart contract. In this paper, we propose a bloom filter-enabled multi-keyword search protocol with enhanced efficiency as well as privacy preservation. In the protocol, a low-frequency keyword selected by a bloom filter will be used to filter the database when performing a multi-keyword search operation. Because the keyword is of low frequency, the majority of the data will be excluded from the result, which reduces the computational cost significantly. Moreover, we propose to use pseudorandom tags to facilitate completing each search operation in only one round. In this way, no intermediate results are generated, and the privacy is preserved. Finally, we implement the protocol in a local simulated blockchain network and conduct extensive experiments. The results indicate that our multi-keyword search protocol outperforms the traditional method with an average of 14.67% less time delay and 59.96% less financial cost.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"34 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":"126904313","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}

引用次数: 59

BlockV: A Blockchain Enabled Peer-Peer Ride Sharing Service BlockV:一个支持区块链的点对点拼车服务

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

P. Pal, S. Ruj

{"title":"BlockV: A Blockchain Enabled Peer-Peer Ride Sharing Service","authors":"P. Pal, S. Ruj","doi":"10.1109/Blockchain.2019.00070","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00070","url":null,"abstract":"Ride sharing is a centralized trust based system where users trust the service providers for the ride set up, tracking, cancellation, fare calculation etc. Any malicious activity in the centralized server based system or driver or rider destroys the fairness involved in the ride and causes inconvenience to the parties. After the completion of the ride, the drivers are rated by the riders. There are possibilities that, a malicious rider can claim the refund with a fake complain and give the driver poor rating. Current system is not capable of deciding the correctness of the objections raised by either parties and provides a biased outcome of each objections as per the centralized company's marketing strategies. We present BlockV, a blockchain enabled solution to ensure the fairness of the ride. The creation, completion, dissatisfaction or abortion of any ride will be written in the blockchain ledger, hence will be available to all participants in the peer to peer network. This simultaneously ensures the fairness in maintenance of the inbuilt reputation system. We have implemented a prototype in Ethereum private network and KOVAN test network and the analysis is included.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"22 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":"125374703","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}

引用次数: 15

Endorsement in Hyperledger Fabric 在超级账本结构中背书

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

Elli Androulaki, Angelo De Caro, M. Neugschwandtner, A. Sorniotti

引用次数: 22