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

A Permissioned Blockchain Based Access Control System for IOT 基于许可区块链的物联网访问控制系统

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

Md. Azharul Islam, S. Madria

引用次数: 39

Blockchain Implementation for Analysis of Carbon Footprint across Food Supply Chain 区块链食品供应链碳足迹分析的实施

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

Denisolt Shakhbulatov, Arshit Arora, Z. Dong, R. Rojas-Cessa

引用次数: 27

DaiMoN: A Decentralized Artificial Intelligence Model Network 戴蒙:一个分散的人工智能模型网络

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

Surat Teerapittayanon, H. T. Kung

{"title":"DaiMoN: A Decentralized Artificial Intelligence Model Network","authors":"Surat Teerapittayanon, H. T. Kung","doi":"10.1109/Blockchain.2019.00026","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00026","url":null,"abstract":"We introduce DaiMoN, a decentralized artificial intelligence model network, which incentivizes peer collaboration in improving the accuracy of machine learning models for a given classification problem. It is an autonomous network where peers may submit models with improved accuracy and other peers may verify the accuracy improvement. The system maintains an append-only decentralized ledger to keep the log of critical information, including who has trained the model and improved its accuracy, when it has been improved, by how much it has improved, and where to find the newly updated model. DaiMoN rewards these contributing peers with cryptographic tokens. A main feature of DaiMoN is that it allows peers to verify the accuracy improvement of submitted models without knowing the test labels. This is an essential component in order to mitigate intentional model overfitting by model-improving peers. To enable this model accuracy evaluation with hidden test labels, DaiMoN uses a novel learnable Distance Embedding for Labels (DEL) function proposed in this paper. Specific to each test dataset, DEL scrambles the test label vector by embedding it in a low-dimension space while approximately preserving the distance between the dataset's test label vector and a label vector inferred by the classifier. It therefore allows proof-of-improvement (PoI) by peers without providing them access to true test labels. We provide analysis and empirical evidence that under DEL, peers can accurately assess model accuracy. We also argue that it is hard to invert the embedding function and thus, DEL is resilient against attacks aiming to recover test labels in order to cheat. Our prototype implementation of DaiMoN is available at https://github.com/steerapi/daimon.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"7 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120863537","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

Yugala: Blockchain Based Encrypted Cloud Storage for IoT Data Yugala:基于区块链的物联网数据加密云存储

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

Sarada Prasad Gochhayat, Eranga Bandara, S. Shetty, Peter B. Foytik

{"title":"Yugala: Blockchain Based Encrypted Cloud Storage for IoT Data","authors":"Sarada Prasad Gochhayat, Eranga Bandara, S. Shetty, Peter B. Foytik","doi":"10.1109/Blockchain.2019.00073","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00073","url":null,"abstract":"Cloud storage enables users to upload, store and download their data. However, with the rapid growth of the Internet of Things (IoT) and edge devices, such as camera, the cloud not only manages the user generate data but also devices generated data. This increment in the volume of outsourced data has raised two important issues in big data management for cloud storage servers, namely, optimal data storage and data security. In order to solve the former issue, cloud storage employs a deduplication technique to avoids storing duplicate data; and uses encryption to solve the later issue. However, both these issues are orthogonal in nature. Thanks to convergent encryption that addresses both the issues simultaneously. Nevertheless, the existing approaches relies on proxy servers and put all the trust on third party, which is vulnerable to single point failure. In this paper, we propose a novel lightweight decentralized encrypted cloud storage architecture called, Yugula, which maintains file confidentiality, removes the centralized data deduplication and increases file integrity by using blockchain. In particular, we discuss two approaches for file confidentiality with data deduplication: one uses double hashing and the other symmetric encryption. In order to show the efficiency and usability, we implemented the proposed architecture and showed its results in terms of high transaction throughput requirement for IoT data management in cloud storage.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"2004 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":"125617385","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}

引用次数: 17

Smart Contract Defense through Bytecode Rewriting 通过字节码重写实现智能合约防御

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

G. Ayoade, Erick Bauman, L. Khan, Kevin W. Hamlen

{"title":"Smart Contract Defense through Bytecode Rewriting","authors":"G. Ayoade, Erick Bauman, L. Khan, Kevin W. Hamlen","doi":"10.1109/Blockchain.2019.00059","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00059","url":null,"abstract":"An Ethereum bytecode rewriting and validation architecture is proposed and evaluated for securing smart contracts in decentralized cryptocurrency systems without access to contract source code. This addresses a wave of smart contract vulnerabilities that have been exploited by cybercriminals in recent years to steal millions of dollars from victims. Such attacks have motivated various best practices proposals for helping developers write safer contracts; but as the number of programming languages used to develop smart contracts increases, implementing these best practices can be cumbersome and hard to enforce across the development tool chain. Automated hardening at the bytecode level bypasses this source-level heterogeneity to enforce safety and code integrity properties of contracts independently of the sources whence they were derived. In addition, a binary code verification tool implemented atop the Coq interactive theorem prover establishes input-output equivalence between the original code and the modified code. Evaluation demonstrates that the system can enforce policies that protect against integer overflow and underflow vulnerabilities in real Ethereum contract bytecode, and overhead is measured in terms of instruction counts.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"28 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":"114194501","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}

引用次数: 11

Scalable Privacy-Preserving Query Processing over Ethereum Blockchain 以太坊区块链上可扩展的隐私保护查询处理

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

Shlomi Linoy, Hassan Mahdikhani, S. Ray, Rongxing Lu, Natalia Stakhanova, A. Ghorbani

引用次数: 13

A Proposal for Account Recovery in Decentralized Applications 去中心化应用中账户恢复的建议

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

Yanlin Zhu, Lirong Xia, O. Seneviratne

{"title":"A Proposal for Account Recovery in Decentralized Applications","authors":"Yanlin Zhu, Lirong Xia, O. Seneviratne","doi":"10.1109/Blockchain.2019.00028","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00028","url":null,"abstract":"Decentralized applications achieve stronger security and fault tolerance by placing trust in the majority of users instead of a single third party. However, it also means that there will be no administrator to handle unexpected situations. Because there is no trusted central management service, a decentralized application can do little when a user loses their private key that unlocks the tokens and other assets the user possesses, and users are responsible for keeping exclusive control of their private keys. Therefore, as decentralized applications are becoming mainstream, and more and more non-tech savvy users began to use these decentralized apps, account recovery will be a much-needed feature. In this paper, we propose a method to recover an account by an arbitration process that utilizes the information asymmetry between the regular users and trade partners an individual may have had over the life of their blockchain account for which they lost access. Our method involves a spam filter to separate legitimate requests from malicious or spam requests, a robust voting mechanism backed by game-theoretic insights, and an extensive set of controls to avert any attacks.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"1 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":"131415737","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

Effective Scheme against 51% Attack on Proof-of-Work Blockchain with History Weighted Information 基于历史加权信息的工作量证明区块链抗51%攻击的有效方案

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

Xinle Yang, Yang Chen, Xiaohu Chen

引用次数: 58

Properties of the Tangle for Uniform Random and Random Walk Tip Selection 均匀随机和随机行走尖端选择的缠结特性

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

B. Kusmierz, William Sanders, A. Penzkofer, A. Capossele, Alon Gal

{"title":"Properties of the Tangle for Uniform Random and Random Walk Tip Selection","authors":"B. Kusmierz, William Sanders, A. Penzkofer, A. Capossele, Alon Gal","doi":"10.1109/Blockchain.2019.00037","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00037","url":null,"abstract":"The growing number of applications for distributed ledger technologies is driving both industry and academia to solve the limitations of blockchain, particularly its scalability issues. Recent distributed ledger technologies have replaced the blockchain linear structure with a more flexible directed acyclic graph in an attempt to accommodate a higher throughput. Despite the fast-growing diffusion of directed acyclic graph based distributed ledger technologies, researchers lack a basic understanding of their behavior. In this paper we analyze the Tangle, a directed acyclic graph that is used (with certain modifications) in various protocols such as IOTA, Byteball, Avalanche or SPECTRE. Our contribution is threefold. First, we run simulations in a continuous-time model to examine tip count stability and cumulative weight evolution while varying the rate of incoming transactions. In particular we confirm analytical predictions on the number of tips with uniform random tip selection strategy. Second, we show how different tip selection algorithms affect the growth of the Tangle. Moreover, we explain these differences by analyzing the spread of exit probabilities of random walks. Our findings confirm analytically derived predictions and provide novel insights on the different phases of growth of cumulative weight as well as on the average time difference for a transaction to receive its first approval when using distinct tip selection algorithms. Lastly, we analyze simulation overhead and performance as a function of Tangle size and compare results for different tip selection algorithms.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"9 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":"117104436","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}

引用次数: 26

Deterministic Sub-Wallet for Cryptocurrencies 加密货币的确定性子钱包

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

Hossein Rezaeighaleh, C. Zou

{"title":"Deterministic Sub-Wallet for Cryptocurrencies","authors":"Hossein Rezaeighaleh, C. Zou","doi":"10.1109/Blockchain.2019.00064","DOIUrl":"https://doi.org/10.1109/Blockchain.2019.00064","url":null,"abstract":"A big challenge in cryptocurrency is securing a user key from potential hackers because nobody can rollback a transaction made by an attacker with a stolen key once the blockchain network confirms it. One solution to protect users is splitting the money between super-wallet and sub-wallet. The user stores a large amount of money on her super-wallet and keeps it safe; she refills the sub-wallet when she needs while using the sub-wallet for her daily purchases. In this paper, we propose a new scheme to create sub-wallet that we call deterministic sub-wallet. In this scheme, the seed of the sub-wallet keys is derived from the super-wallet master seed, and therefore the super-wallet can build many sub-wallet addresses and refill them in a single blockchain transaction. Compared to existing approaches, our mechanism is cheaper, real-time, more secure against man-in-the-middle attack and easier for backup and recovery. We implement a proof-of-concept on a hardware wallet and evaluate its performance. In addition, we analyze the attacks and defenses of this design to demonstrate that our proposed method has a higher level of security than existing models.","PeriodicalId":221068,"journal":{"name":"2019 IEEE International Conference on Blockchain (Blockchain)","volume":"43 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":"130532309","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}

引用次数: 10