TL;DR
MOF-BC introduces a memory-efficient, privacy-preserving blockchain model tailored for large-scale networks like IoT, enabling data removal and summarization while maintaining security and reducing storage and user costs.
Contribution
This paper presents MOF-BC, a novel blockchain framework that allows data removal and privacy features in IoT environments, with a new Generator Verifier concept and incentive mechanisms.
Findings
Reduces blockchain memory usage by up to 25%.
Decreases user costs by over two orders of magnitude.
Demonstrates resilience against security attacks.
Abstract
BlockChain (BC) immutability ensures BC resilience against modification or removal of the stored data. In large scale networks like the Internet of Things (IoT), however, this feature significantly increases BC storage size and raises privacy challenges. In this paper, we propose a Memory Optimized and Flexible BC (MOF-BC) that enables the IoT users and service providers to remove or summarize their transactions and age their data and to exercise the "right to be forgotten". To increase privacy, a user may employ multiple keys for different transactions. To allow for the removal of stored transactions, 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
