Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security 2012
DOI: 10.1145/2414456.2414503
|View full text |Cite
|
Sign up to set email alerts
|

Towards efficient proofs of retrievability

Abstract: Proofs of Retrievability (POR) is a cryptographic formulation for remotely auditing the integrity of files stored in the cloud, without keeping a copy of the original files in local storage. In a POR scheme, a user Alice backups her data file together with some authentication data to a potentially dishonest cloud storage server Bob. Later, Alice can periodically and remotely verify the integrity of her data file using the authentication data, without retrieving back the data file. Besides security, performance… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
70
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 71 publications
(70 citation statements)
references
References 18 publications
0
70
0
Order By: Relevance
“…Xu et al [12] proposed a new concept to prove the server data possession. In their algorithm, the client creates tags as polynomials and considers the file blocks as coefficients to polynomials.…”
Section: Related Workmentioning
confidence: 99%
“…Xu et al [12] proposed a new concept to prove the server data possession. In their algorithm, the client creates tags as polynomials and considers the file blocks as coefficients to polynomials.…”
Section: Related Workmentioning
confidence: 99%
“…We adopt the formulation of proofs of retrievability from existing works [26,27] and make some syntactical modifications according to our needs to construct proofs of ownership scheme.…”
Section: Proofs Of Retrievabilitymentioning
confidence: 99%
“…Recently, Xu et al [23] propose a new concept to prove the server data possession. That is, the client creates tags as polynomials and considers the file blocks as coefficients to polynomials.…”
Section: B Related Workmentioning
confidence: 99%
“…Recently, to mitigate these concerns, many efforts have been proposed under different systems and security models [2]- [4], [10], [17], [18], [23]. These schemes are called Provable Data Possession PDP schemes.…”
mentioning
confidence: 99%