Please use this identifier to cite or link to this item: http://artemis.cslab.ece.ntua.gr:8080/jspui/handle/123456789/17763
Full metadata record
DC FieldValueLanguage
dc.contributor.authorΚώνστα, Αλύζια-Μαρία-
dc.date.accessioned2020-11-07T13:47:37Z-
dc.date.available2020-11-07T13:47:37Z-
dc.date.issued2020-10-29-
dc.identifier.urihttp://artemis.cslab.ece.ntua.gr:8080/jspui/handle/123456789/17763-
dc.description.abstractThe purpose of the diploma thesis is to develop a data storage system, which provides high performance while ensuring data security. To achieve high performance but also for scalability in relation to the volume of data, we usually resort to distributed approaches such as HDFS or Google GFS. However, as there is no longer a central authority that we trust but in a distributed system nodes can run from different physical entities, the issue of data trust and security arises. To deal with this problem, in this work we use blockchain technology. The ability to execute code in a verifiable way (smart contracts) has led to the adoption of blockchains in a variety of applications beyond cryptocurrencies. The system we developed integrates the Ethereum blockchain into HDFS and ensures that no node can modify / delete files without doing so through the HDFS protocol. The experimental evaluation of the system showed that security does not come for free but we have to sacrifice part of the performance. More specifically, we pay on time an additional x% when importing files and a y% on system availability.en_US
dc.languageenen_US
dc.subjectBlockchainen_US
dc.subjectMerkle Treesen_US
dc.subjectHDFSen_US
dc.titleVerifiable Distributed Storage Using Blockchainen_US
dc.description.pages111en_US
dc.contributor.supervisorΚοζύρης Νεκτάριοςen_US
dc.departmentΤομέας Τεχνολογίας Πληροφορικής και Υπολογιστώνen_US
Appears in Collections:Διπλωματικές Εργασίες - Theses

Files in This Item:
File Description SizeFormat 
diploma_thesis_Alyzia_Konsta.pdf2.81 MBAdobe PDFView/Open


Items in Artemis are protected by copyright, with all rights reserved, unless otherwise indicated.