MOF-BC: A memory optimized and flexible blockchain for large scale networks

被引:67
作者
Dorri, Ali [1 ,2 ]
Kanhere, Salil S. [1 ]
Jurdak, Raja [2 ]
机构
[1] UNSW, Sch Comp Sci & Engn, Sydney, NSW, Australia
[2] CSIRO, DATA61, Brisbane, Qld, Australia
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2019年 / 92卷
关键词
Blockcha in; Auditing; Privacy; Internet of Things;
D O I
10.1016/j.future.2018.10.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The inherent immutability offered by Blockchains (BC) ensures resilience against modification or removal of the stored data. In large scale networks like the Internet of Things (loT), however, this feature significantly increases BC storage size and raises privacy concerns. In this paper, we propose a Memory Optimized and Flexible BC (MOF-BC) that enables the loT users and service providers to remove or summarize their transactions and age their data and thus exercise their "right to be forgotten". To increase privacy, a user may employ multiple keys for different transactions. However, to facilitate removal of the stored transactions in the future, all keys would need to be stored which complicates key management and storage. MOF-BC introduces the notion of a Generator Verifier (GV) which is a signed hash of a Generator Verifier Secret (GVS). The GV changes for each transaction to provide privacy yet is signed by a unique key, thus minimizing the information that needs to be stored. A flexible transaction fee model and a reward mechanism is proposed to incentivize users to participate in optimizing memory consumption. We propose MOF-BC as a generalized solution, which can be implemented on top of any existing or future BC instantiation. Qualitative security and privacy analysis demonstrates that MOF-BC is resilient against several security attacks. Evaluation results show that MOF-BC decreases BC memory consumption by up to 25% and the cost incurred by users by more than two orders of magnitude compared to conventional BC instantiations. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:357 / 373
页数:17
相关论文
共 25 条
[1]  
Abramowicz M., 2016, Ariz. Law Rev., V58, P359
[2]  
[Anonymous], 2017, ARXIV PREPRINT ARXIV
[3]  
[Anonymous], 2011, 1021651 TS ERSI TISP
[4]  
[Anonymous], 2016, DCCL
[5]  
[Anonymous], ARXIV170508230
[6]  
[Anonymous], 2010, P 1 WORKSH GREEN COM, DOI DOI 10.1145/1925013.1925015
[7]  
[Anonymous], INT C FIN CRYPT DAT
[8]  
Apthorpe N., 2017, ARXIV170506805
[9]   Redactable Blockchain - or - Rewriting History in Bitcoin and Friends [J].
Ateniese, Giuseppe ;
Magri, Bernardo ;
Venturi, Daniele ;
Andrade, Ewerton R. .
2017 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P), 2017, :111-126
[10]   Blockchains and Smart Contracts for the Internet of Things [J].
Christidis, Konstantinos ;
Devetsikiotis, Michael .
IEEE ACCESS, 2016, 4 :2292-2303