poster

Public Access

Poster: Proofs of Retrievability with Low Server Storage

Authors:

Michael Hanling,

Gaspard Anthoine,

Jean-Guillaume Dumas,

Aude Maignan,

Clément Pernet,

Daniel S. RocheAuthors Info & Claims

CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Pages 2601 - 2603

https://doi.org/10.1145/3319535.3363266

Published: 06 November 2019 Publication History

PDF eReader

Abstract

Proof of Retrievability (PoR) and Provable Data Possession (PDP) schemes have been proposed to ensure the integrity of stored data on untrusted servers. A successful PoR audit ensures, with high probability, that every piece of stored data is recoverable by the server. Most PoR schemes proposed have focused on bandwidth and computation cost, but in some deployment scenarios the size of remote storage can be the most expensive factor. We propose a simple PoR scheme which is a variant on some existing PDP work. Compared to existing audit routines, the server computation cost and bandwidth are higher, but the server storage cost is minimal. Our preliminary work indicates that deploying this scheme may be less costly in commercial cloud settings, depending on the cost structure and frequency of audits.

References

[1]

Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary Peterson, and Dawn Song. 2007. Provable Data Possession at Untrusted Stores. In Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS '07). ACM, New York, NY, USA, 598--609. https://doi.org/10.1145/1315245.1315318

Digital Library

Google Scholar

[2]

David Cash, Alptekin Kupcu, and Daniel Wichs. 2012. Dynamic Proofs of Retrievability via Oblivious RAM. Technical Report 550. http://eprint.iacr.org/2012/550

Google Scholar

[3]

C. Chris Erway, Alptekin Küpccü, Charalampos Papamanthou, and Roberto Tamassia. 2015. Dynamic Provable Data Possession. ACM Trans. Inf. Syst. Secur., Vol. 17, 4, Article 15 (April 2015), 29 pages. https://doi.org/10.1145/2699909

Digital Library

Google Scholar

[4]

R=usicn vs Freivalds. 1979. Fast Probabilistic Algorithms. In Mathematical Foundations of Computer Science 1979 (LNCS), J. Bevc vávr (Ed.), Vol. 74. Springer-Verlag, Olomouc, Czechoslovakia, 57--69. https://doi.org/10.1007/3--540-09526--8_5

Crossref

Google Scholar

[5]

Ari Juels and Burton S. Kaliski. 2007. PORs: proofs of retrievability for large files. In Proceedings of the 14th ACM conference on Computer and communications security - CCS '07. ACM Press, Alexandria, Virginia, USA, 584. https://doi.org/10.1145/1315245.1315317

Crossref

Google Scholar

[6]

Ralph C. Merkle. 1988. A Digital Signature Based on a Conventional Encryption Function. In Advances in Cryptology -- CRYPTO '87, Carl Pomerance (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 369--378.

Google Scholar

[7]

F. Sebé, J. Domingo-Ferrer, A. Martinez-Balleste, Y. Deswarte, and J. Quisquater. 2008. Efficient Remote Data Possession Checking in Critical Information Infrastructures. IEEE Transactions on Knowledge and Data Engineering, Vol. 20, 8 (Aug 2008), 1034--1038. https://doi.org/10.1109/TKDE.2007.190647

Digital Library

Google Scholar

[8]

Hovav Shacham and Brent Waters. 2013. Compact Proofs of Retrievability. J. Cryptol., Vol. 26, 3 (July 2013), 442--483. https://doi.org/10.1007/s00145-012--9129--2

Digital Library

Google Scholar

[9]

Elaine Shi, Emil Stefanov, and Charalampos Papamanthou. 2013. Practical Dynamic Proofs of Retrievability. In Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security (CCS '13). ACM, New York, NY, USA, 325--336. https://doi.org/10.1145/2508859.2516669

Digital Library

Google Scholar

Cited By

View all

Ateniese GBaldimtsi FCampanelli MFrancati DKarantaidou I(2024)Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial EvaluationAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68379-4_1(3-39)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68379-4_1
Zhang YYou WJia SLiu LLi ZQian W(2022)EnclavePoStSecurity and Communication Networks10.1155/2022/78685022022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7868502
Yu HHu QYang ZLiu H(2021)Efficient Continuous Big Data Integrity Checking for Decentralized StorageIEEE Transactions on Network Science and Engineering10.1109/TNSE.2021.30682618:2(1658-1673)Online publication date: 1-Apr-2021
https://doi.org/10.1109/TNSE.2021.3068261
Show More Cited By

Index Terms

Poster: Proofs of Retrievability with Low Server Storage
1. Security and privacy
  1. Database and storage security

Recommendations

Security analysis of a publicly verifiable data possession scheme for remote storage

As an essential technology of cloud computing, the cloud storage can exactly satisfy the demand of users with the service of scalability, ubiquitous access and low maintenance cost. However, moving data to the cloud servers will bring some significant ...
One Digit Checksum for Data Integrity Verification of Cloud-executed Homomorphic Encryption Operations
ICFNDS '23: Proceedings of the 7th International Conference on Future Networks and Distributed Systems

Homomorphic encryption is used in many fields, including information storage, data protection, privacy preservation, blockchain, and authentication. This kind of encryption allows an untrusted third party to perform algebraic operations on encrypted ...
Cloud data integrity checking with an identity-based auditing mechanism from RSA

Cloud data auditing is extremely essential for securing cloud storage since it enables cloud users to verify the integrity of their outsourced data efficiently. The computation overheads on both the cloud server and the verifier can be significantly ...

Comments

Information & Contributors

Information

Published In

CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

November 2019

2755 pages

ISBN:9781450367479

DOI:10.1145/3319535

General Chairs:
Lorenzo Cavallaro
King's College London, UK
,
Johannes Kinder
Bundeswehr University Munich, Germany
,
Program Chairs:
XiaoFeng Wang
Indiana University, USA
,
Jonathan Katz
George Mason University, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2019

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

National Science Foundation

Conference

CCS '19

Sponsor:

SIGSAC

CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security

November 11 - 15, 2019

London, United Kingdom

Acceptance Rates

CCS '19 Paper Acceptance Rate 149 of 934 submissions, 16%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
456
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)8

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ateniese GBaldimtsi FCampanelli MFrancati DKarantaidou I(2024)Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial EvaluationAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68379-4_1(3-39)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68379-4_1
Zhang YYou WJia SLiu LLi ZQian W(2022)EnclavePoStSecurity and Communication Networks10.1155/2022/78685022022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7868502
Yu HHu QYang ZLiu H(2021)Efficient Continuous Big Data Integrity Checking for Decentralized StorageIEEE Transactions on Network Science and Engineering10.1109/TNSE.2021.30682618:2(1658-1673)Online publication date: 1-Apr-2021
https://doi.org/10.1109/TNSE.2021.3068261
Chen JChen XHe KDu RChen WXiang Y(2021)DELIA: Distributed Efficient Log Integrity Audit Based on Hierarchal Multi-Party State ChannelIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.3092365(1-1)Online publication date: 2021
https://doi.org/10.1109/TDSC.2021.3092365

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Security analysis of a publicly verifiable data possession scheme for remote storage

One Digit Checksum for Data Integrity Verification of Cloud-executed Homomorphic Encryption Operations

Cloud data integrity checking with an identity-based auditing mechanism from RSA