Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/105806
Title: Fair and dynamic proofs of retrievability
Authors: Nguyen, Ngoc Tram Anh
Keywords: DRNTU::Engineering::Computer science and engineering::Computing methodologies
Issue Date: 2014
Source: Nguyen, N. T. A. (2014). Fair and dynamic proofs of retrievability. Student research paper, Nanyang Technological University.
Abstract: One of the big trends of computing nowadays is cloud computing. More users rely on cloud computing for data storage because of its usefulness and mobility. However, the cloud server may be untrustworthy and may modify or manipulate the outsourced data without our knowing. The scheme we are presenting in this paper has the ability to spot any abnormality in the data stored and also retrieve back the lost data in some cases. It also supports dynamic data (data that can be modified, inserted or deleted). That means the authentication data can be updated as soon as the outsourced data are changed. The scheme also protects an honest cloud server over a dishonest client.
URI: https://hdl.handle.net/10356/105806
http://hdl.handle.net/10220/26032
Rights: © 2014 The Author(s).
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:URECA Papers

Files in This Item:
File Description SizeFormat 
SCE13074_NGUYEN NGOC TRAM ANH.pdf353.17 kBAdobe PDFThumbnail
View/Open

Page view(s) 10

812
Updated on Feb 7, 2023

Download(s) 20

288
Updated on Feb 7, 2023

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.