Accountable storage

Giuseppe Ateniese; Michael T. Goodrich; Vassilios Lekakis; Charalampos Papamanthou; Evripidis Paraskevas; Roberto Tamassia

doi:10.1007/978-3-319-61204-1_31

Accountable storage

Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 Scopus citations

Abstract

We introduce Accountable Storage (AS), a framework enabling a client to outsource n file blocks to a server while being able (any time after outsourcing) to provably compute how many bits were discarded or corrupted by the server. Existing techniques (e.g., proofs of data possession or storage) can address the accountable storage problem, with linear server computation and bandwidth. Instead, our optimized protocols achieve O(δ log n) complexity (where δ is the maximum number of corrupted blocks that can be tolerated) through the novel use of invertible Bloom filters and a new primitive called proofs of partial storage. With accountable storage, a client can be compensated with a dollar amount proportional to the number d of corrupted bits (that he can now provably compute). We integrate our protocol with Bitcoin, supporting automatic such compensations. Our implementation is open-source and shows our protocols perform well in practice.

Original language	English
Title of host publication	Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings
Editors	Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
Pages	623-644
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-319-61204-1_31
State	Published - 2017
Event	15th International Conference on Applied Cryptography and Network Security, ACNS 2017 - Kanazawa, Japan Duration: 10 Jul 2017 → 12 Jul 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10355 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on Applied Cryptography and Network Security, ACNS 2017
Country/Territory	Japan
City	Kanazawa
Period	10/07/17 → 12/07/17

Access to Document

10.1007/978-3-319-61204-1_31

Cite this

Ateniese, G., Goodrich, M. T., Lekakis, V., Papamanthou, C., Paraskevas, E., & Tamassia, R. (2017). Accountable storage. In D. Gollmann, A. Miyaji, & H. Kikuchi (Eds.), Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings (pp. 623-644). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10355 LNCS). https://doi.org/10.1007/978-3-319-61204-1_31

Ateniese, Giuseppe ; Goodrich, Michael T. ; Lekakis, Vassilios et al. / Accountable storage. Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings. editor / Dieter Gollmann ; Atsuko Miyaji ; Hiroaki Kikuchi. 2017. pp. 623-644 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{875b79068b604cda91a58344c88850c6,

title = "Accountable storage",

abstract = "We introduce Accountable Storage (AS), a framework enabling a client to outsource n file blocks to a server while being able (any time after outsourcing) to provably compute how many bits were discarded or corrupted by the server. Existing techniques (e.g., proofs of data possession or storage) can address the accountable storage problem, with linear server computation and bandwidth. Instead, our optimized protocols achieve O(δ log n) complexity (where δ is the maximum number of corrupted blocks that can be tolerated) through the novel use of invertible Bloom filters and a new primitive called proofs of partial storage. With accountable storage, a client can be compensated with a dollar amount proportional to the number d of corrupted bits (that he can now provably compute). We integrate our protocol with Bitcoin, supporting automatic such compensations. Our implementation is open-source and shows our protocols perform well in practice.",

author = "Giuseppe Ateniese and Goodrich, {Michael T.} and Vassilios Lekakis and Charalampos Papamanthou and Evripidis Paraskevas and Roberto Tamassia",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 15th International Conference on Applied Cryptography and Network Security, ACNS 2017 ; Conference date: 10-07-2017 Through 12-07-2017",

year = "2017",

doi = "10.1007/978-3-319-61204-1_31",

language = "English",

isbn = "9783319612034",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "623--644",

editor = "Dieter Gollmann and Atsuko Miyaji and Hiroaki Kikuchi",

booktitle = "Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings",

}

Ateniese, G, Goodrich, MT, Lekakis, V, Papamanthou, C, Paraskevas, E & Tamassia, R 2017, Accountable storage. in D Gollmann, A Miyaji & H Kikuchi (eds), Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10355 LNCS, pp. 623-644, 15th International Conference on Applied Cryptography and Network Security, ACNS 2017, Kanazawa, Japan, 10/07/17. https://doi.org/10.1007/978-3-319-61204-1_31

Accountable storage. / Ateniese, Giuseppe; Goodrich, Michael T.; Lekakis, Vassilios et al.
Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings. ed. / Dieter Gollmann; Atsuko Miyaji; Hiroaki Kikuchi. 2017. p. 623-644 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10355 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Accountable storage

AU - Ateniese, Giuseppe

AU - Goodrich, Michael T.

AU - Lekakis, Vassilios

AU - Papamanthou, Charalampos

AU - Paraskevas, Evripidis

AU - Tamassia, Roberto

N1 - Publisher Copyright: © Springer International Publishing AG 2017.

PY - 2017

Y1 - 2017

N2 - We introduce Accountable Storage (AS), a framework enabling a client to outsource n file blocks to a server while being able (any time after outsourcing) to provably compute how many bits were discarded or corrupted by the server. Existing techniques (e.g., proofs of data possession or storage) can address the accountable storage problem, with linear server computation and bandwidth. Instead, our optimized protocols achieve O(δ log n) complexity (where δ is the maximum number of corrupted blocks that can be tolerated) through the novel use of invertible Bloom filters and a new primitive called proofs of partial storage. With accountable storage, a client can be compensated with a dollar amount proportional to the number d of corrupted bits (that he can now provably compute). We integrate our protocol with Bitcoin, supporting automatic such compensations. Our implementation is open-source and shows our protocols perform well in practice.

AB - We introduce Accountable Storage (AS), a framework enabling a client to outsource n file blocks to a server while being able (any time after outsourcing) to provably compute how many bits were discarded or corrupted by the server. Existing techniques (e.g., proofs of data possession or storage) can address the accountable storage problem, with linear server computation and bandwidth. Instead, our optimized protocols achieve O(δ log n) complexity (where δ is the maximum number of corrupted blocks that can be tolerated) through the novel use of invertible Bloom filters and a new primitive called proofs of partial storage. With accountable storage, a client can be compensated with a dollar amount proportional to the number d of corrupted bits (that he can now provably compute). We integrate our protocol with Bitcoin, supporting automatic such compensations. Our implementation is open-source and shows our protocols perform well in practice.

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

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

U2 - 10.1007/978-3-319-61204-1_31

DO - 10.1007/978-3-319-61204-1_31

M3 - Conference contribution

AN - SCOPUS:85022333337

SN - 9783319612034

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 623

EP - 644

BT - Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings

A2 - Gollmann, Dieter

A2 - Miyaji, Atsuko

A2 - Kikuchi, Hiroaki

T2 - 15th International Conference on Applied Cryptography and Network Security, ACNS 2017

Y2 - 10 July 2017 through 12 July 2017

ER -

Ateniese G, Goodrich MT, Lekakis V, Papamanthou C, Paraskevas E, Tamassia R. Accountable storage. In Gollmann D, Miyaji A, Kikuchi H, editors, Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings. 2017. p. 623-644. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-61204-1_31

Accountable storage

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this