Publication:
Dynamic proofs of retrievability via oblivious RAM

dc.contributor.coauthorCash, David
dc.contributor.coauthorWichs, Daniel
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.kuauthorKüpçü, Alptekin
dc.contributor.kuprofileFaculty Member
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.yokid168060
dc.date.accessioned2024-11-10T00:08:28Z
dc.date.issued2013
dc.description.abstractProofs of retrievability allow a client to store her data on a remote server (eg., "in the cloud") and periodically execute an efficient audit protocol to check that all of the data is being maintained correctly and can be recovered from the server. For efficiency, the computation and communication of the server and client during an audit protocol should be significantly smaller than reading/transmitting the data in its entirety. Although the server is only asked to access a few locations of its storage during an audit, it must maintain full knowledge of all client data to be able to pass. Starting with the work of Juels and Kaliski (CCS '07), all prior solutions require that the client data is static and do not allow it to be efficiently updated. Indeed, they store a redundant encoding of the data on the server, so that the server must delete a large fraction of its storage to 'lose' any actual content. Unfortunately, this means that even a single bit modification to the original data will need to modify a large fraction of the server storage, which makes updates highly inefficient. In this work, we give the first solution providing proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient protocol with the server. At any point in time, the client can also execute an audit protocol to ensure that the server maintains the latest version of its data. The computation and communication complexity of the server and client in our protocols is only polylogarithmic in the size of the data. Our main idea is to split up the data into small blocks and redundantly encode each block of data individually, so that an update inside any data block only affects a few codeword symbols. The main difficulty is to prevent the server from identifying and deleting too many codeword symbols belonging to any single data block. We do so by hiding where the various codeword symbols are stored on the server and when they are being accessed by the client, using the techniques of oblivious RAM.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.openaccessYES
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuTÜBİTAK
dc.description.sponsorshipInternational Association for Cryptologic Research (IACR)
dc.description.volume7881 LNCS
dc.identifier.doi10.1007/978-3-642-38348-9_17
dc.identifier.isbn9783-6423-8347-2
dc.identifier.issn0302-9743
dc.identifier.linkhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84883411598&doi=10.1007%2f978-3-642-38348-9_17&partnerID=40&md5=c906100986aa76b1948bfd06c3962948
dc.identifier.quartileN/A
dc.identifier.scopus2-s2.0-84883411598
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-642-38348-9_17
dc.identifier.urihttps://hdl.handle.net/20.500.14288/16960
dc.identifier.wos392129000002
dc.keywordsAudit protocol
dc.keywordsCommunication complexity
dc.keywordsData blocks
dc.keywordsDynamic storage
dc.keywordsEfficient protocols
dc.keywordsPolylogarithmic
dc.keywordsRedundant encoding
dc.keywordsRemote servers
dc.keywordsCommunication
dc.keywordsCryptography
dc.keywordsEncoding (symbols)
dc.keywordsManagement
dc.keywordsRandom access storage
dc.languageEnglish
dc.publisherSpringer
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subjectGeneral computer science
dc.subjectTheoretical computer science
dc.titleDynamic proofs of retrievability via oblivious RAM
dc.typeConference proceeding
dspace.entity.typePublication
local.contributor.authorid0000-0003-2099-2206
local.contributor.kuauthorKüpçü, Alptekin
relation.isOrgUnitOfPublication89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isOrgUnitOfPublication.latestForDiscovery89352e43-bf09-4ef4-82f6-6f9d0174ebae

Files