G-IOTA: Fair and confidence aware tangle

February 15, 2019 Β· Declared Dead Β· πŸ› Conference on Computer Communications Workshops

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gewu Bu, Γ–nder GΓΌrcan, Maria Potop-Butucaru arXiv ID 1902.09472 Category cs.DC: Distributed Computing Cross-listed cs.NI Citations 43 Venue Conference on Computer Communications Workshops Last Checked 6 months ago
Abstract
This paper proposes strategies to improve the IOTA tangle in terms of resilience to splitting attacks. Our contribution is two fold. First, we define the notion of confidence fairness for tips selection algorithms to guarantee the first approval for all honest tips. Then, we analyze IOTA-tangle from the point of view of confidence fairness and identify its drawbacks. Second, we propose a new selection mechanism, G-IOTA, that targets to protect tips left behind. G-IOTA therefore has a good confidence fairness. G-IOTA lets honest transactions increase their confidence efficiently. Furthermore, G-IOTA includes an incentive mechanism for users who respect the algorithm and punishes conflicting transactions. Additionally, G-IOTA provides a mutual supervision mechanism that reduces the benefits of speculative and lazy behaviours.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted