{"title":"Lottery DApp from Multi-Randomness Extraction","authors":"Yu-Chi Chen, Song-Yi Hsu, Ting-Wei Chang, Ting-Wei Wu","doi":"10.1109/BLOC.2019.8751323","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751323","url":null,"abstract":"Randomness is a significant ingredient to achieve fairness on many applications (i.e., gambling). On the use of blockchain and smart contract, we observe that some existing lottery and gambling games involve one single source to produce randomness. As known, Fomo3D uses the game state to determine the winner, whereas TrueFlip uses the blockchain state (at a specific point in time). Those system do not rely on significant randomness extraction. In this paper, we present a lottery DApp and implement it by using smart contracts. In this DApp, the randomness is determined not only from game and blockchain states, but also from committees.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127392541","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":"On the specification and verification of atomic swap smart contracts (extended abstract)","authors":"R. V. D. Meyden","doi":"10.1109/BLOC.2019.8751250","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751250","url":null,"abstract":"This paper investigates the specification and verification of atomic swap multi-party transactions. It is argued that logics with the ability to express properties of strategies of players in a multi-agent setting are conceptually useful for this purpose, although ultimately, the less expressive setting of temporal logic suffices for verification of concrete implementations. This is illustrated through the use of a model checker to verify atomic swap smart contracts in on-chain and cross-chain settings.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121903047","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}
Muhammad Saad, Afsah Anwar, Ashar Ahmad, Hisham Alasmary, M. Yuksel, Aziz Mohaisen
{"title":"RouteChain: Towards Blockchain-based Secure and Efficient BGP Routing","authors":"Muhammad Saad, Afsah Anwar, Ashar Ahmad, Hisham Alasmary, M. Yuksel, Aziz Mohaisen","doi":"10.1109/BLOC.2019.8751229","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751229","url":null,"abstract":"Routing on the Internet is defined among autonomous systems (ASes) based on a weak trust model where it is assumed that ASes are honest. While this trust model strengthens the connectivity among ASes, it results in an attack surface which is exploited by malicious entities to hijacking routing paths. One such attack is known as the BGP prefix hijacking, in which a malicious AS broadcasts IP prefixes that belong to a target AS, thereby hijacking its traffic. In this paper, we proposeRouteChain: a blockchain-based secure BGP routing system that counters BGP hijacking and maintains a consistent view of the Internet routing paths. Towards that, we leverage provenance assurance and tamper-proof properties of blockchains to augment trust among ASes. We group ASes based on their geographical (network) proximity and construct a bihierarchical blockchain model that detects false prefixes prior to their spread over the Internet. We validate strengths of our design by simulations and show its effectiveness by drawing a case study with the Youtube hijacking of 2008. Our proposed scheme is a standalone service that can be incrementally deployed without the need of a central authority.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"568 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121005153","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}
Nelson Bore, Andrew Kinai, Juliet Mutahi, David Kaguma, Frederlck Otieno, S. Remy, Komminist Weldemariam
{"title":"On Using Blockchain Based Workflows","authors":"Nelson Bore, Andrew Kinai, Juliet Mutahi, David Kaguma, Frederlck Otieno, S. Remy, Komminist Weldemariam","doi":"10.1109/BLOC.2019.8751446","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751446","url":null,"abstract":"We have been involved in the development of several blockchain-based solutions that largely utilize workflows. Workflows are used to guide users from independent organizations to process and manage transactions, data and documents in a trusted, immutable, and transparent manner for all relevant entities on a given blockchain network. This work discusses our approach to automate the process of creating, updating, and using workflows for blockchain-based solutions. In particular, we present a workflow definition schema using existing templates. We also show how the workflow definition is used to automate the generation of graphical user interfaces and the possibility of generating associated blockchain smart contracts in the future.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124191755","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":"ICBC 2019 Author Index","authors":"","doi":"10.1109/bloc.2019.8751264","DOIUrl":"https://doi.org/10.1109/bloc.2019.8751264","url":null,"abstract":"","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130139182","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":"ICBC 2019 Committees","authors":"","doi":"10.1109/bloc.2019.8751411","DOIUrl":"https://doi.org/10.1109/bloc.2019.8751411","url":null,"abstract":"","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"530 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124508927","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":"Achieving Fairness in the Tangle through an Adaptive Rate Control Algorithm","authors":"Luigi Vigneri, W. Welz, Alon Gal, V. Dimitrov","doi":"10.1109/BLOC.2019.8751358","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751358","url":null,"abstract":"Throughput is a key property for any distributed ledger technology. However, limited resources, such as bandwidth or node computational power, can lead to network congestion when nodes try to issue more transactions than the network can handle. Consequently, priority criteria are necessary to determine whether a transaction should be accepted or not. In this paper, we present a novel adaptive rate control algorithm for the Tangle, a new-generation distributed ledger allowing large throughput. Our approach combines various concepts, such as resource tests and Proof-of-Work with dynamic difficulty. Our algorithm not only serves as an anti-spam mechanism, but also achieves fair representation. This is to be contrasted with pure Proof-of-Work blockchains, which lead to wasteful mining races.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130462214","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}
Shenbin Zhang, Ence Zhou, Bingfeng Pi, Jun Sun, K. Yamashita, Yoshihide Nomura
{"title":"A Solution for the Risk of Non-deterministic Transactions in Hyperledger Fabric","authors":"Shenbin Zhang, Ence Zhou, Bingfeng Pi, Jun Sun, K. Yamashita, Yoshihide Nomura","doi":"10.1109/BLOC.2019.8751453","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751453","url":null,"abstract":"Blockchain is one of the most popular distributed ledger technologies. In order to solve the trustless problems between enterprises, many permissioned blockchain platforms are proposed in recent years. Hyperledger Fabric is a permissioned blockchain which is comprised of chaincode, endorsing peers, ordering service, committing peers and membership service. Fabric provides identity authentication, transactions encryption and high performance. Hence, decentralized application based on Fabric can be applied among enterprises to implement the immutable and high throughput for transactions. However, some limitations still exist in Fabric framework. This paper surveys the risk of non-deterministic transactions in Fabric, which can be caused by read-write conflict and transactions order dependency. Transactions are judged to be invalid by committing peers when read-write conflict exists. Besides, transactions submission order may be disrupted during endorsing and ordering. Both of the two risks can make the final transaction execution result non-deterministic. Finally, a solution of cache layer on Fabric client is proposed to solve the risk of non-deterministic transactions.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125539304","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":"Banklaves: Concept for a Trustworthy Decentralized Payment Service for Bitcoin","authors":"Matthias Grundmann, M. Leinweber, H. Hartenstein","doi":"10.1109/BLOC.2019.8751394","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751394","url":null,"abstract":"We explore challenges of and present a concept for a decentralized payment service which is based on trusted execution environments. The system guarantees that users can always cash out their funds without depending on the cooperation of other network members, hence minimizing the trust required in other network members. We present an overview of the system, motivate key components for a secure architecture and provide a communication protocol. We prove that the payment service users can cash out their funds at any time without any dependence on other network members.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167923","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}
R. Raman, R. Vaculín, M. Hind, S. Remy, E. Pissadaki, N. Bore, Roozbeh Daneshvar, B. Srivastava, Kush R. Varshney
{"title":"A Scalable Blockchain Approach for Trusted Computation and Verifiable Simulation in Multi-Party Collaborations","authors":"R. Raman, R. Vaculín, M. Hind, S. Remy, E. Pissadaki, N. Bore, Roozbeh Daneshvar, B. Srivastava, Kush R. Varshney","doi":"10.1109/BLOC.2019.8751387","DOIUrl":"https://doi.org/10.1109/BLOC.2019.8751387","url":null,"abstract":"In high-stakes multi-party policy making based on machine learning and simulation models involving independent computing agents, a notion of trust in results is critical in facilitating transparency, accountability, and collaboration. Using a novel combination of distributed validation of atomic computation blocks and a blockchain-based immutable audit mechanism, this work proposes a framework for distributed trust in computations. In particular we address the scalability problem by reducing the storage and communication costs using a lossy compression scheme. This framework guarantees not only verifiability of final results, but also the validity of local computations, and its cost-benefit tradeoffs are studied using a synthetic example of training a neural network.","PeriodicalId":314490,"journal":{"name":"2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129548300","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}