Beyond proofs of data possession: Finding defective blocks in outsourced storage

Juan Camilo Corena, Anirban Basu, Shinsaku Kiyomoto, Yutaka Miyake, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Proofs of Data Possession (PDPs) are protocols that allow a file owner to verify that a file stored at an outsourced server is stored entirely. From a security perspective, it must be difficult for the server to pass the verification protocol if the file is not available. Even though several efficient PDPs exist in the literature, to the best of our knowledge no special algorithms, besides the existing combinatorial approaches have been designed to find what exact blocks of the file are defective. In this article we present an efficient method to find what blocks are defective in a server, even when the server might lie; we show that by taking advantage of the homomorphic properties of existing PDPs, we can improve existing combinatorial methods to find the defective blocks. Our method involves a single invocation of the PDP's verification protocol and an additional communication overhead, which is never larger than the number of blocks of the file regardless of the number of missing blocks. For cases where few blocks have been corrupted, the transmission overhead is proportional to the the number of missing block times the logarithm of the length of the file. This is a significant improvement from existing combinatorial methods which exhibit worse performance than the naive approach (where the result of the PDP for each block is sent independently) as the number of corrupted blocks increases.

Original languageEnglish
Title of host publication2014 IEEE Global Communications Conference, GLOBECOM 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2381-2386
Number of pages6
ISBN (Print)9781479935116
DOIs
Publication statusPublished - 2014 Feb 9
Event2014 IEEE Global Communications Conference, GLOBECOM 2014 - Austin, United States
Duration: 2014 Dec 82014 Dec 12

Other

Other2014 IEEE Global Communications Conference, GLOBECOM 2014
CountryUnited States
CityAustin
Period14/12/814/12/12

Fingerprint

possession
Servers
Network protocols
communication
Communication
performance

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Communication

Cite this

Corena, J. C., Basu, A., Kiyomoto, S., Miyake, Y., & Ohtsuki, T. (2014). Beyond proofs of data possession: Finding defective blocks in outsourced storage. In 2014 IEEE Global Communications Conference, GLOBECOM 2014 (pp. 2381-2386). [7037164] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2014.7037164

Beyond proofs of data possession : Finding defective blocks in outsourced storage. / Corena, Juan Camilo; Basu, Anirban; Kiyomoto, Shinsaku; Miyake, Yutaka; Ohtsuki, Tomoaki.

2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2381-2386 7037164.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Corena, JC, Basu, A, Kiyomoto, S, Miyake, Y & Ohtsuki, T 2014, Beyond proofs of data possession: Finding defective blocks in outsourced storage. in 2014 IEEE Global Communications Conference, GLOBECOM 2014., 7037164, Institute of Electrical and Electronics Engineers Inc., pp. 2381-2386, 2014 IEEE Global Communications Conference, GLOBECOM 2014, Austin, United States, 14/12/8. https://doi.org/10.1109/GLOCOM.2014.7037164
Corena JC, Basu A, Kiyomoto S, Miyake Y, Ohtsuki T. Beyond proofs of data possession: Finding defective blocks in outsourced storage. In 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 2381-2386. 7037164 https://doi.org/10.1109/GLOCOM.2014.7037164
Corena, Juan Camilo ; Basu, Anirban ; Kiyomoto, Shinsaku ; Miyake, Yutaka ; Ohtsuki, Tomoaki. / Beyond proofs of data possession : Finding defective blocks in outsourced storage. 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 2381-2386
@inproceedings{0c09f0154ffc4d589d23887f80af6f0d,
title = "Beyond proofs of data possession: Finding defective blocks in outsourced storage",
abstract = "Proofs of Data Possession (PDPs) are protocols that allow a file owner to verify that a file stored at an outsourced server is stored entirely. From a security perspective, it must be difficult for the server to pass the verification protocol if the file is not available. Even though several efficient PDPs exist in the literature, to the best of our knowledge no special algorithms, besides the existing combinatorial approaches have been designed to find what exact blocks of the file are defective. In this article we present an efficient method to find what blocks are defective in a server, even when the server might lie; we show that by taking advantage of the homomorphic properties of existing PDPs, we can improve existing combinatorial methods to find the defective blocks. Our method involves a single invocation of the PDP's verification protocol and an additional communication overhead, which is never larger than the number of blocks of the file regardless of the number of missing blocks. For cases where few blocks have been corrupted, the transmission overhead is proportional to the the number of missing block times the logarithm of the length of the file. This is a significant improvement from existing combinatorial methods which exhibit worse performance than the naive approach (where the result of the PDP for each block is sent independently) as the number of corrupted blocks increases.",
author = "Corena, {Juan Camilo} and Anirban Basu and Shinsaku Kiyomoto and Yutaka Miyake and Tomoaki Ohtsuki",
year = "2014",
month = "2",
day = "9",
doi = "10.1109/GLOCOM.2014.7037164",
language = "English",
isbn = "9781479935116",
pages = "2381--2386",
booktitle = "2014 IEEE Global Communications Conference, GLOBECOM 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Beyond proofs of data possession

T2 - Finding defective blocks in outsourced storage

AU - Corena, Juan Camilo

AU - Basu, Anirban

AU - Kiyomoto, Shinsaku

AU - Miyake, Yutaka

AU - Ohtsuki, Tomoaki

PY - 2014/2/9

Y1 - 2014/2/9

N2 - Proofs of Data Possession (PDPs) are protocols that allow a file owner to verify that a file stored at an outsourced server is stored entirely. From a security perspective, it must be difficult for the server to pass the verification protocol if the file is not available. Even though several efficient PDPs exist in the literature, to the best of our knowledge no special algorithms, besides the existing combinatorial approaches have been designed to find what exact blocks of the file are defective. In this article we present an efficient method to find what blocks are defective in a server, even when the server might lie; we show that by taking advantage of the homomorphic properties of existing PDPs, we can improve existing combinatorial methods to find the defective blocks. Our method involves a single invocation of the PDP's verification protocol and an additional communication overhead, which is never larger than the number of blocks of the file regardless of the number of missing blocks. For cases where few blocks have been corrupted, the transmission overhead is proportional to the the number of missing block times the logarithm of the length of the file. This is a significant improvement from existing combinatorial methods which exhibit worse performance than the naive approach (where the result of the PDP for each block is sent independently) as the number of corrupted blocks increases.

AB - Proofs of Data Possession (PDPs) are protocols that allow a file owner to verify that a file stored at an outsourced server is stored entirely. From a security perspective, it must be difficult for the server to pass the verification protocol if the file is not available. Even though several efficient PDPs exist in the literature, to the best of our knowledge no special algorithms, besides the existing combinatorial approaches have been designed to find what exact blocks of the file are defective. In this article we present an efficient method to find what blocks are defective in a server, even when the server might lie; we show that by taking advantage of the homomorphic properties of existing PDPs, we can improve existing combinatorial methods to find the defective blocks. Our method involves a single invocation of the PDP's verification protocol and an additional communication overhead, which is never larger than the number of blocks of the file regardless of the number of missing blocks. For cases where few blocks have been corrupted, the transmission overhead is proportional to the the number of missing block times the logarithm of the length of the file. This is a significant improvement from existing combinatorial methods which exhibit worse performance than the naive approach (where the result of the PDP for each block is sent independently) as the number of corrupted blocks increases.

UR - http://www.scopus.com/inward/record.url?scp=84949922959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949922959&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2014.7037164

DO - 10.1109/GLOCOM.2014.7037164

M3 - Conference contribution

AN - SCOPUS:84949922959

SN - 9781479935116

SP - 2381

EP - 2386

BT - 2014 IEEE Global Communications Conference, GLOBECOM 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -