2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)最新文献

筛选
英文 中文
Blockchain: A Novel Approach for the Consensus Algorithm Using Condorcet Voting Procedure 区块链:使用孔多塞投票程序的共识算法的新方法
D. Vangulick, B. Cornélusse, D. Ernst
{"title":"Blockchain: A Novel Approach for the Consensus Algorithm Using Condorcet Voting Procedure","authors":"D. Vangulick, B. Cornélusse, D. Ernst","doi":"10.1109/DAPPCON.2019.00011","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00011","url":null,"abstract":"The blockchain technology allows interested parties to access a common register, the update, and integrity of which are collectively managed in a decentralized manner by a network of actors. It is the consensus protocol that ensures a common and unambiguous update of transactions by creating blocks of transactions for which integrity, veracity, and consistency are guaranteed through geographically distributed nodes. Bitcoin, the first popular blockchain concept, introduced the Proof of Work consensus based on work validation, and has been extended to thousands of participants. Despite its success and its large use in other crypto-currencies, Proof of Work's disadvantages are a high latency, a low transaction rate, and a high energy expenditure, making it a less-than-perfect choice for many applications. In addition the validation of transactions is not carried out with a definite temporality. For Bitcoin, it takes on average 10 minutes to create a block. However, for certain use cases such as auctions or the exchange of energy, there is a need for this temporality. The purpose of this article is to propose a new type of consensus that is faster, less energy-consuming and that can be synchronized with a time reference. The core of the reflection is the use of the Condorcet voting mechanism to determine the miner.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133675141","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
A Survey of Tools for Analyzing Ethereum Smart Contracts 分析以太坊智能合约的工具综述
Monika Di Angelo, G. Salzer
{"title":"A Survey of Tools for Analyzing Ethereum Smart Contracts","authors":"Monika Di Angelo, G. Salzer","doi":"10.1109/DAPPCON.2019.00018","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00018","url":null,"abstract":"Smart contracts are at the heart of many decentralized applications, encapsulating core parts of the business logic. They handle the exchange of valuable assets like crypto-currencies or tokens in a transparent, decentralized manner. Being computer programs, they are also prone to programming errors, which have already lead to spectacular losses. Therefore, methods and tools have emerged to support the development of secure smart contracts and to aid the analysis of deployed ones. Assessing the quality of such tools turns out to be difficult. There are academic tools, tools developed by companies, and community tools in open repositories, but no comprehensive survey that may serve as a guide. Most discussions of related work in research papers are not helpful either, as they concentrate on methods rather than tools, base their review on publications about the tools rather than the tools themselves, or disregard tools outside of academia. Our survey aims at filling this gap by considering tools regardless of their provenance and by installing and testing them. It is meant as a guide for those who intend to analyze already deployed code, want to develop secure smart contracts, or plan to teach a related subject. We investigate 27 tools for analyzing Ethereum smart contracts regarding availability, maturity level, methods employed, and detection of security issues.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856895","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}
引用次数: 114
Integration of Blockchain and Internet of Things in a Car Supply Chain 区块链与物联网在汽车供应链中的融合
Tim Reimers, Felix Leber, U. Lechner
{"title":"Integration of Blockchain and Internet of Things in a Car Supply Chain","authors":"Tim Reimers, Felix Leber, U. Lechner","doi":"10.1109/DAPPCON.2019.00028","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00028","url":null,"abstract":"This short paper presents a proof-of-concept prototype how distributed ledger technology can be used to ensure transparency of production: the blockchain collects data from machines and sensors, ensures integrity of information, integrates a database and enables traceability. The prototype is developed according to the design science paradigm to demonstrate the principles of blockchain and Internet of Things integration in an automotive manufacturing use case. We present an information system architecture for a traceability system based on blockchain technology and Internet of Things.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115302416","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}
引用次数: 18
Supporting Reuse of Smart Contracts through Service Orientation and Assisted Development 通过面向服务和辅助开发支持智能合约的重用
Luca Guida, F. Daniel
{"title":"Supporting Reuse of Smart Contracts through Service Orientation and Assisted Development","authors":"Luca Guida, F. Daniel","doi":"10.1109/DAPPCON.2019.00017","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00017","url":null,"abstract":"This paper focuses on two of the key challenges a developer encounters when reusing smart contracts: finding actionable information about existing smart contracts (descriptors) and writing the necessary integration logic to invoke selected contracts and implement missing functions. As for the former issue, the paper proposes a smart contract description format that allows the developer to search for publicly available contracts, understand which features a contract exposes and how to invoke them, according to a service-oriented approach. For the latter, the paper implements a simple, model-driven development environment consisting in a visual programming editor that provides a set of modeling constructs encoding specific, reuse-oriented code patterns. The approach is implemented and demonstrated in the context of the blockchain platform Ethereum and its programming language Solidity. The results obtained show that the proposed approach can be beneficial in the development of composite smart contracts and generic blockchain applications.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578910","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}
引用次数: 12
A Usage-Based Mechanism for Securing Systems Via Blockchains 通过区块链保护系统的基于使用的机制
Eric Brigham, J. Doucette, M. Lepinski
{"title":"A Usage-Based Mechanism for Securing Systems Via Blockchains","authors":"Eric Brigham, J. Doucette, M. Lepinski","doi":"10.1109/DAPPCON.2019.00016","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00016","url":null,"abstract":"The costs of operating a secure system are not always shared proportionately to the benefits that participants receive, which often hinders the adoption of security solutions. Blockchains provide us with an economic framework to distribute costs through cryptographic contracts, however, existing work in building secure applications using blockchains does not take advantage of this framework to align costs and benefits for system participants. One such application is the security of the domain name system. Past attempts to secure the DNS using blockchains suffer from a common problem: the costs of security are not shared proportionately to the benefits that participants receive, because benefits are tied to reading the secured content, while costs are tied to writing it into the blockchain. In this paper, we outline a new blockchain model for supporting secure systems in which users pay for the system at a rate proportionate to the benefits they receive. This is achieved by charging participants based on the frequency with which their content is securely retrieved and used by others, rather than the frequency with which they post or update content. The resulting model provides a flexible way to control the compensation and transaction rates of miners, and has applications to security in numerous problem domains.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128016594","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}
引用次数: 0
Lock and Load: A Model for Free Blockchain Transactions through Token Locking 锁和加载:通过令牌锁定的免费区块链交易模型
Paul Merrill, Thomas H. Austin, Jenil Thakker, Younghee Park, Justin Rietz
{"title":"Lock and Load: A Model for Free Blockchain Transactions through Token Locking","authors":"Paul Merrill, Thomas H. Austin, Jenil Thakker, Younghee Park, Justin Rietz","doi":"10.1109/DAPPCON.2019.00013","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00013","url":null,"abstract":"Bitcoin introduced the world to blockchain-based cryptocurrencies, and Ethereum highlighted their value in building distributed applications (dApps). However, the development of blockchain-based applications has been held back by high transaction fees. In this paper, we introduce a model for free transactions on the blockchain. Rather than spending tokens for transaction fees, a token owner (known as a client) locks tokens to generate new tokens as a reward for the miner who includes the transaction in a block. This token-locking reward model eases congestion on the blockchain in the same manner as fees do in protocols like Bitcoin, but without forcing clients to sacrifice their tokens. This same design can be used to incentivize service providers. We show how a client can lock their tokens to generate new tokens for storage providers, and how this reward mechanism can help to facilitate an audit of the storage provider.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073379","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
Modularizing Cross-Cutting Concerns with Aspect-Oriented Extensions for Solidity 用面向方面的扩展模块化横切关注点
Chien-Che Hung, Kung Chen, Chun-Feng Liao
{"title":"Modularizing Cross-Cutting Concerns with Aspect-Oriented Extensions for Solidity","authors":"Chien-Che Hung, Kung Chen, Chun-Feng Liao","doi":"10.1109/DAPPCON.2019.00033","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00033","url":null,"abstract":"Over the past few years, blockchain technology has attracted much attention. The smart contract is a computer program that implements and executes transactions and business logic on the blockchain. Unlike traditional general-purpose programming languages, the modularization techniques of programming languages for the smart contracts are still immature. Specifically, a suitable modularization mechanism for cross-cutting concerns is still not available. From a software engineering perspective, the modularization of cross-cutting concerns is a fundamental issue that can dramatically affect the contracts' maintainability and readability. As a result, reducing the redundant cross-cutting logic is still a challenging task. This paper proposes a practically viable approach that supports Aspect-Oriented Programming (AOP) for smart contract development on Ethereum-based blockchains. We suggest a set of extension to Solidity, a programming language that runs on the Ethereum-based blockchains, that facilitates AOP semantics and behaviors. As a proof of concept, we also realize the weaving module for the extension. The feasibility of the proposed approach is demonstrated by a case study.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793470","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
Strengthening Smart Contracts to Handle Unexpected Situations 加强智能合约以处理意外情况
Shuze Liu, Farhad Mohsin, Lirong Xia, O. Seneviratne
{"title":"Strengthening Smart Contracts to Handle Unexpected Situations","authors":"Shuze Liu, Farhad Mohsin, Lirong Xia, O. Seneviratne","doi":"10.1109/DAPPCON.2019.00034","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00034","url":null,"abstract":"Decentralized application users may face unexpected situations that the smart contract implementing the application should handle, but cannot, because the smart contract cannot be modified once it is deployed. Therefore, we need 'stronger' smart contracts with flexible structures that are resilient in such unexpected situations. In this paper, we propose a generic mechanism to strengthen smart contracts and handle possible unexpected situations. Given a smart contract, this mechanism automatically generates an action list which offers actions as interfaces to change parameters of smart contracts and a voting system that utilizes a limited voter group randomly chosen from the peers. Each action in the action list can change a corresponding parameter of smart contracts. The actions, when approved by the majority, are executed to change the parameters. When users face unexpected situations in a transaction, they choose some actions as the solution and pass them to the voting system. Since a smart contract has finite parameters, there are finite actions. By arranging and combining these actions, our mechanism offers solutions that can handle wide-ranging unexpected situations. Also, to execute a solution, the majority of voters need to approve it, thus not violating the protocol of the original smart contract. Voters are rewarded based on quadratic rules for peer prediction, which makes telling true preferences the only way to maximize rewards. Using machine learning, we predict users' preferences based on the voting records. The predictions are provided as default values for future votes to avoid users' need to vote manually each time.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128327232","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}
引用次数: 6
Alt-PoW: An Alternative Proof-of-Work Mechanism Alt-PoW:一种替代的工作量证明机制
Sarah Sharkey, H. Tewari
{"title":"Alt-PoW: An Alternative Proof-of-Work Mechanism","authors":"Sarah Sharkey, H. Tewari","doi":"10.1109/DAPPCON.2019.00012","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00012","url":null,"abstract":"Bitcoin is the world's most successful digital currency. It uses a public distributed ledger called the blockchain to maintain the transaction history in the network. It employs a Proof-of-Work (PoW) protocol for miners to add more blocks of transactions to the chain in order to arrive at a consensus of the state of the network. Due to the nature of the consensus mechanism used, miners are not given any sense of their progression when solving a PoW problem. The only strategy presented to them is a brute-force search where it is unknown to them how far away they or other miners are to a solution, and if the problem is worth dedicating further resources to. This results in a slow and highly energy inefficient consensus protocol. In this paper we present an alternative PoW mechanism which introduces the idea of progression when solving such puzzles. This Alt-PoW mechanism gives participants a network view of how all other miners are faring in the block finding process, so they can decide whether it is in their interest to withdraw from a block race or to continue dedicating their resources towards it. We also present a mechanism to allow for multiple interconnected chains as opposed to a single blockchain, so that block finding can be parallelized. Participants can decide which chain to dedicated their resources to, based on which has the best chance of them being successful mining on at any particular time. We show that this results in a faster and more energy efficient protocol.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121586094","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
An Improved Non-Interactive Zero-Knowledge Range Proof for Decentralized Applications 一种改进的去中心化应用的非交互式零知识范围证明
Ya Che Tsai, R. Tso, Zi-Yuan Liu, Kung Chen
{"title":"An Improved Non-Interactive Zero-Knowledge Range Proof for Decentralized Applications","authors":"Ya Che Tsai, R. Tso, Zi-Yuan Liu, Kung Chen","doi":"10.1109/DAPPCON.2019.00025","DOIUrl":"https://doi.org/10.1109/DAPPCON.2019.00025","url":null,"abstract":"Blockchain is the core technology underlying the first decentralized cryptocurrency, Bitcoin, introduced by Nakamoto in 2008. Since then, blockchain technology has many more advancements that are being developed and experimented. In particular, recent blockchain platforms such as Ethereum offer general and executable scripts, namely smart contracts, that can be employed to develop decentralized applications (DApps) in many domains beyond payment. However, the transparency of blockchain data raises concerns for many applications that require high privacy level. Therefore, many privacy enhancing technologies have been applied to DApp development, including zero knowledge proof (ZKP). This paper focuses on a particular kind of ZKP, called zero knowledge range proof (ZKRP), that has been applied in blockchain-based payments for banks. ZKRP allows a user to convince other people that a secret value actually lies within an interval without revealing any information about the secret. Here we introduce a new ZKRP which has the following remarkable features: (1) Non-interactive: No communication is required between a user and a verifier during the proof. (2) Range-flexibility: There is no limitation on the lower bound and the upper bound of the range except that they are natural numbers. (3) Efficiency: Our scheme is modified from that of Pang et al. (2010), yet achieves better security and is more efficient than their scheme. We believe our new ZKRP can be beneficial to the development of DApps and can extend the application scope to more scenarios.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126011560","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信