[Paper Review] Metamorphic IOTA.

Gewu Bu, Wassim Hana+1 more|arXiv (Cornell University)|Jul 8, 2019

Blockchain Technology Applications and Security4 references4 citations

TL;DR

This paper proposes E-IOTA, a parameterized metamorphic tip selection algorithm for IOTA that reduces random walks while maintaining IOTA's security and G-IOTA's fairness and confidence in tip selection. It provides the first formal security analysis of IOTA and its derivatives against key attacks, offering a more efficient and provably secure alternative for IoT-based distributed ledgers.

ABSTRACT

IOTA opened recently a new line of research in distributed ledgers area by targeting algorithms that ensure a high throughput for the transactions generated in IoT systems. Transactions are continuously appended to an acyclic structure called tangle and each new transaction selects as parents two existing transactions (called tips) that it approves. G-IOTA, a very recent improvement of IOTA, targets to protect tips left behind offering hence a good confidence level. However, this improvement had a cost: the use of an additional tip selection mechanism which may be critical in IoT systems since it needs additional energy consumption. In this paper we propose a new metamorphic algorithm for tip selection that offers the best guaranties of both IOTA and G-IOTA. Our contribution is two fold. First, we propose a parameterized algorithm, E-IOTA, for tip selection which targets to reduce the number of random walks executed in previous versions (IOTA and G-IOTA) while maintaining the same security guaranties as IOTA and the same confidence level and fairness with respect to tips selection as G-IOTA. Then we propose a formal analysis of the security guaranties offered by E-IOTA against various attacks mentioned in the original IOTA proposal (e.g. large weight attack, parasite chain attack and splitting attack). Interestingly, to the best of our knowledge this is the first formal analysis of the security guaranties of IOTA and its derivatives.

Motivation & Objective

• To address the high energy cost of tip selection in IoT-based distributed ledgers by reducing the number of random walks in IOTA and G-IOTA.
• To maintain the same security guarantees as IOTA while achieving the same confidence level and fairness in tip selection as G-IOTA.
• To propose a formal security analysis of IOTA and its derivatives against known attacks, such as parasite chain and large weight attacks.

Proposed method

• Proposing E-IOTA, a parameterized tip selection algorithm that dynamically adjusts the number of random walks based on system parameters.
• Integrating a metamorphic mechanism that adapts tip selection behavior to reduce redundant random walks without compromising security.
• Using a weighted random walk strategy where the probability of selecting a tip depends on its cumulative weight and depth in the tangle.
• Formalizing security properties through a model that captures attack vectors like parasite chains, large weight manipulation, and splitting attacks.
• Defining a confidence level metric for tips based on accumulated weight and propagation time to ensure reliability.
• Applying formal verification techniques to prove that E-IOTA resists known attacks under the same assumptions as IOTA and G-IOTA.

Experimental results

Research questions

• RQ1 Can a reduced number of random walks in tip selection maintain the same security guarantees as the original IOTA protocol?
• RQ2 Does the proposed E-IOTA algorithm preserve the fairness and confidence level of G-IOTA while reducing computational overhead?
• RQ3 What formal security guarantees does E-IOTA offer against parasite chain, large weight, and splitting attacks compared to IOTA and G-IOTA?
• RQ4 How does parameterization in E-IOTA affect the trade-off between efficiency and security in IoT environments?
• RQ5 Is it possible to formally verify the security properties of IOTA and its derivatives for the first time?

Key findings

• E-IOTA significantly reduces the number of random walks required for tip selection while preserving the same security guarantees as the original IOTA protocol.
• The algorithm achieves the same level of confidence and fairness in tip selection as G-IOTA, without requiring additional mechanisms that increase energy consumption.
• Formal analysis confirms that E-IOTA resists parasite chain, large weight, and splitting attacks under the same threat model as IOTA and G-IOTA.
• The parameterized design of E-IOTA enables tunable efficiency-security trade-offs, making it suitable for resource-constrained IoT environments.
• This work presents the first formal security analysis of IOTA and its derivatives, establishing a foundation for future verification of distributed ledger protocols.