dc.contributor.advisor | Singh, Priyanka | |
dc.contributor.author | Joshi, Kriti | |
dc.date.accessioned | 2022-05-06T04:43:33Z | |
dc.date.available | 2023-02-25T04:43:33Z | |
dc.date.issued | 2021 | |
dc.identifier.citation | Joshi, Kriti (2021). MBE: Client Side Secure Data Deduplication Based on Merkel Tree. Dhirubhai Ambani Institute of Information and Communication Technology. viii, 32 p. (Acc.No: T00985) | |
dc.identifier.uri | http://drsr.daiict.ac.in//handle/123456789/1045 | |
dc.description.abstract | Several secure data deduplication protocols are recently proposed to maintain unique data copies at the cloud service providers (CSP’s) and utilize the storage space efficiently. Though many Message Locked Encryption (MLE) based protocols exist to deduplicate but delimits in handling various attack scenarios like poison attack, dictionary attack, side channel attack and frequency analysis attack. Moreover, maintaining the integrity of the data while being stored at the CSPs poses fresh challenges. In this thesis, we propose MBE, a client side data deduplication protocol that handles the aforementioned attack scenarios and also validates the data integrity at the client as well as the server end. Further, the MBE protocol authenticates the client through a proof of work (PoW) protocol based on the merkle tree and also detects the tamper at the block level. Communication and computation cost analysis are done for the proposed and the other state-of-the-art protocols to validate the efficacy of the proposed MBE protocol. | |
dc.subject | Secure Data | |
dc.subject | Merkel Tree | |
dc.subject | Deduplication protocol | |
dc.subject | Message Locked Encryption | |
dc.subject | Proof of work | |
dc.subject | MBE protocol | |
dc.classification.ddc | 658.11 JOS | |
dc.title | MBE: Client Side Secure Data Deduplication Based on Merkel Tree | |
dc.type | Dissertation | |
dc.degree | M. Tech | |
dc.student.id | 201911060 | |
dc.accession.number | T00985 | |