Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evidence that multiple copies of the data are actually stored. Storage servers can collude to make it look like they are storing many copies of the data, whereas in reality they only store a single copy. We address this shortcoming through multiple-replica provable data possession (MR-PDP): A provably-secure scheme that allows a client that stores t replicas of a file in a storage system to verify through a challenge-response protocol that (1) each unique replica can be produced at the time of the challenge and that (2) the storage system uses t times the storage required to store a single replica. MR-PDP extends previous work on data possession proofs for a single copy of a file in a client/server storage system [4]. Using MR-PDP to store t replicas is computationally much more efficient than using a single-replica PDP scheme to store t separate, unrelated files (e.g., by encrypting each file separately prior to storing it). Another advantage of MR-PDP is that it can generate further replicas on demand, at little expense, when some of the existing replicas fail. © 2008 IEEE.

MR-PDP: Multiple-replica provable data possession / Reza, Curtmola; Osama, Khan; Randal, Burns; Ateniese, Giuseppe. - (2008), pp. 411-420. (Intervento presentato al convegno 28th International Conference on Distributed Computing Systems, ICDCS 2008 tenutosi a Beijing nel 17 July 2008 through 20 July 2008) [10.1109/icdcs.2008.68].

MR-PDP: Multiple-replica provable data possession

ATENIESE, GIUSEPPE
2008

Abstract

Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evidence that multiple copies of the data are actually stored. Storage servers can collude to make it look like they are storing many copies of the data, whereas in reality they only store a single copy. We address this shortcoming through multiple-replica provable data possession (MR-PDP): A provably-secure scheme that allows a client that stores t replicas of a file in a storage system to verify through a challenge-response protocol that (1) each unique replica can be produced at the time of the challenge and that (2) the storage system uses t times the storage required to store a single replica. MR-PDP extends previous work on data possession proofs for a single copy of a file in a client/server storage system [4]. Using MR-PDP to store t replicas is computationally much more efficient than using a single-replica PDP scheme to store t separate, unrelated files (e.g., by encrypting each file separately prior to storing it). Another advantage of MR-PDP is that it can generate further replicas on demand, at little expense, when some of the existing replicas fail. © 2008 IEEE.
2008
28th International Conference on Distributed Computing Systems, ICDCS 2008
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
MR-PDP: Multiple-replica provable data possession / Reza, Curtmola; Osama, Khan; Randal, Burns; Ateniese, Giuseppe. - (2008), pp. 411-420. (Intervento presentato al convegno 28th International Conference on Distributed Computing Systems, ICDCS 2008 tenutosi a Beijing nel 17 July 2008 through 20 July 2008) [10.1109/icdcs.2008.68].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/431420
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 426
  • ???jsp.display-item.citation.isi??? 256
social impact