Publication:
Energy efficiency in secure and dynamic cloud storage

dc.contributor.coauthorN/A
dc.contributor.departmentN/A
dc.contributor.departmentN/A
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.kuauthorKachkeev, Adilet
dc.contributor.kuauthorEsiner, Ertem
dc.contributor.kuauthorKüpçü, Alptekin
dc.contributor.kuauthorÖzkasap, Öznur
dc.contributor.kuprofileMaster Student
dc.contributor.kuprofileMaster Student
dc.contributor.kuprofileFaculty Member
dc.contributor.kuprofileFaculty Member
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteDepartment of Computer Engineering
dc.contributor.yokidN/A
dc.contributor.yokidN/A
dc.contributor.yokid168060
dc.contributor.yokid113507
dc.date.accessioned2024-11-09T23:12:19Z
dc.date.issued2013
dc.description.abstractThe popularity of the cloud storage systems has brought a number of challenges. Two of them are data integrity and energy efficiency. There are many proposed static solutions to prove the integrity of a file. For the dynamic case, Rank-Based Authenticated Skip list (RBASL) has been presented. It provides the update operations with logarithmic complexity. However, an RBASL expects the block size to be fixed. In a realistic scenario, where the updates can be of variable size, an RBASL performs O(n) update operations on the data structure when a change in the file occurs, where n is the number of blocks. To overcome this problem, we propose Flexible-length based authenticated skip list (FlexList) to make O(u) update operations where u is the number of the update operations. Moreover, we developed an algorithm to carry out multiple challenges at once. We have tested our algorithm, and the results show time and energy efficiencies of 60%, 45%, 35% and 20% for file sizes 4MB, 40MB, 400MB, and 4GB respectively.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.openaccessYES
dc.description.volume8046
dc.identifier.doi10.1007/978-3-642-40517-4_12
dc.identifier.isbn978-3-642-40517-4
dc.identifier.isbn978-3-642-40516-7
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-84885811317
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-642-40517-4_12
dc.identifier.urihttps://hdl.handle.net/20.500.14288/9779
dc.identifier.wos333556100012
dc.keywordsEnergy efficiency
dc.keywordsCloud storage
dc.keywordsSkip list
dc.keywordsProvable data possession
dc.keywordsProofs
dc.keywordsRetrievability
dc.languageEnglish
dc.publisherSpringer-Verlag Berlin
dc.sourceEnergy Efficiency In Large Scale Distributed Systems, Ee-Lsds 2013
dc.subjectComputer science
dc.subjectInformation systems
dc.titleEnergy efficiency in secure and dynamic cloud storage
dc.typeConference proceeding
dspace.entity.typePublication
local.contributor.authoridN/A
local.contributor.authorid0000-0002-3290-2514
local.contributor.authorid0000-0003-2099-2206
local.contributor.authorid0000-0003-4343-0986
local.contributor.kuauthorKachkeev, Adilet
local.contributor.kuauthorEsiner, Ertem
local.contributor.kuauthorKüpçü, Alptekin
local.contributor.kuauthorÖzkasap, Öznur
relation.isOrgUnitOfPublication89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isOrgUnitOfPublication.latestForDiscovery89352e43-bf09-4ef4-82f6-6f9d0174ebae

Files