DONS Dynamic Optimized Neighbor Selection for smart blockchain networks /
Blockchain (BC) systems mainly depend on the consistent state of the Distributed Ledger (DL) at different logical and physical places of the network. The majority of network nodes need to be enforced to use one or both of the following approaches to remain consistent: (i) to wait for certain delays...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2022
|
| Sorozat: | FUTURE GENERATION COMPUTER SYSTEMS
130 |
| Tárgyszavak: | |
| doi: | 10.1016/j.future.2021.12.010 |
| mtmt: | 32588616 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/24287 |
| LEADER | 02847nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | publ24287 | ||
| 005 | 20231222060005.0 | ||
| 008 | 220505s2022 hu o 0|| Angol d | ||
| 022 | |a 0167-739X | ||
| 024 | 7 | |a 10.1016/j.future.2021.12.010 |2 doi | |
| 024 | 7 | |a 32588616 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a Angol | ||
| 100 | 1 | |a Baniata Hamza | |
| 245 | 1 | 0 | |a DONS |h [elektronikus dokumentum] : |b Dynamic Optimized Neighbor Selection for smart blockchain networks / |c Baniata Hamza |
| 260 | |c 2022 | ||
| 300 | |a 75-90 | ||
| 490 | 0 | |a FUTURE GENERATION COMPUTER SYSTEMS |v 130 | |
| 520 | 3 | |a Blockchain (BC) systems mainly depend on the consistent state of the Distributed Ledger (DL) at different logical and physical places of the network. The majority of network nodes need to be enforced to use one or both of the following approaches to remain consistent: (i) to wait for certain delays (i.e. by requesting a hard puzzle solution as in PoW and PoUW, or to wait for random delays as in PoET, etc.) (ii) to propagate shared data through shortest possible paths within the network. The first approach may cause higher energy consumption and/or lower throughput rates if not optimized, and in many cases these features are conventionally fixed. Therefore, it is preferred to enhance the second approach with some optimization. Previous works for this approach have the following drawbacks: they may violate the identity privacy of miners, only locally optimize the Neighbor Selection method (NS), do not consider the dynamicity of the network, or require the nodes to know the precise size of the network at all times. In this paper, we address these issues by proposing a Dynamic and Optimized NS protocol called DONS, using a novel privacy-aware leader election within the public BC called AnoLE, where the leader anonymously solves the The Minimum Spanning Tree problem (MST) of the network in polynomial time. Consequently, miners are informed about the optimum NS according to the current state of network topology. We analytically evaluate the complexity, the security and the privacy of the proposed protocols against state-of-the-art MST solutions for DLs and well known attacks. Additionally, we experimentally show that the proposed protocols outperform state-of-the-art NS solutions for public BCs. Our evaluation shows that the proposed DONS and AnoLE protocols are secure, private, and they acutely outperform all current NS solutions in terms of block finality and fidelity. © 2021 The Author(s) | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 700 | 0 | 1 | |a Anaqreh Ahmad |e aut |
| 700 | 0 | 1 | |a Kertész Attila |e aut |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/24287/3/32588616.pdf |z Dokumentum-elérés |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/24287/1/DONS_FGCS21_accepted_202112.pdf |z Dokumentum-elérés |