Compact Proofs of Retrievability

Shacham, Hovav; Waters, Brent

doi:10.1007/978-3-540-89255-7_7

Cited by 1,003 publications

(1,179 citation statements)

References 11 publications

Supporting

Mentioning

1,119

Contrasting

Order By: Relevance

“…The problem of proof of retrievability was first posed in [53,36], and subsequent protocols include [4,58,22]. A proof of retrievability protocol usually goes like this: after storing a (potentially large) file with the server, the client issues a query to receive an assurance that the file is still correctly stored.…”

Section: Related Workmentioning

confidence: 99%

Verifiable Delegation of Computation over Large Datasets

Benabbas

Gennaro²,

Vahlis

2011

Lecture Notes in Computer Science

268

282

View full text Add to dashboard Cite

We study the problem of computing on large datasets that are stored on an untrusted server. We follow the approach of amortized verifiable computation introduced by Gennaro, Gentry, and Parno in CRYPTO 2010. We present the first practical verifiable computation scheme for high degree polynomial functions. Such functions can be used, for example, to make predictions based on polynomials fitted to a large number of sample points in an experiment. In addition to the many non-cryptographic applications of delegating high degree polynomials, we use our verifiable computation scheme to obtain new solutions for verifiable keyword search, and proofs of retrievability. Our constructions are based on the DDH assumption and its variants, and achieve adaptive security, which was left as an open problem by Gennaro et al (albeit for general functionalities).Our second result is a primitive which we call a verifiable database (VDB). Here, a weak client outsources a large table to an untrusted server, and makes retrieval and update queries. For each query, the server provides a response and a proof that the response was computed correctly. The goal is to minimize the resources required by the client. This is made particularly challenging if the number of update queries is unbounded. We present a VDB scheme based on the hardness of the subgroup membership problem in composite order bilinear groups. This is the first such construction that relies on a "constant-size" assumption, and does not require expensive generation of primes per operation.

show abstract

Section: Related Workmentioning

confidence: 99%

Verifiable Delegation of Computation over Large Datasets

Benabbas

Gennaro²,

Vahlis

2011

Lecture Notes in Computer Science

268

282

View full text Add to dashboard Cite

show abstract

“…Clouds is still under the fear of dogmatism for traditional data confidentiality, integrity, availability, and privacy issues, plus some additional attacks. Recently many works are in continuations that has served a milestone in the way to secure data integrity and storage security in cloud [8], [9], [20][21][22][23][24][25][26].…”

Section: Related Workmentioning

confidence: 99%

“…So, in year 2011 Z. hao [26] suggest a ideal system that uses the protocol based on homomorphic verification tags that are deployed to set up with few algorithms such as SigGen, GenProof, TagGen, Checkproof that can stand proof for the challenges faced in data integrity.…”

Section: Related Workmentioning

confidence: 99%

Survey of Optimized CSP Migration

2015

IJSR

View full text Add to dashboard Cite

Cloud computing allow the different business to emerge upon a large scale, it provide a large computing environment, space, application along with the storage space to the business. Thus allow scaling up the business and slowing down their resource to maintain and stored. More over the cloud environment works on the base of the gain in virtualization of the resources over a network so generally it is compared by grid computing. But it also raises the scale of the server to concern, to manage and to use the application to exabyte, when the service is to be migrated on to the different CSP. The system allows the user to select different CSP or datacenters to manage and store the data but, when migration is done the system needs to retrieve the whole data stored onto their system, which also can allow more faults and process failures to the system. This may lead the system to crash or go in data-lock in condition. To avoid this problem here a survey is done of the system's that are designed to allows user to select their CSP according to their needs on demand, as well as it allow user to select the CSP to migrate on. The transfer of data in the system allows user to transfer whole data to CSP that they had demanded with the provision of fault-tolerance and reliability of data transferred on the new CSP. Even blanks can be filled, as in this survey we also provide TPA relations that acts a middle tier to the user and the CSP that rates the CSP accordingly to the logs. Thus the survey enlightens the performance and experiments of the system.

show abstract

“…A new technique called Provable Data Possession (PDP) generates a probabilistic proof of data integrity based on only a small portion of the file (Ateniese et al 2007). Similarly, there is research around Proof of Retrievability (PoR) to give users assurance that, once data is stored in a public cloud, it will be eventually retrievable (Shacham & Waters 2008). Proof carrying codes (Mahajan 2007) is another mechanism through which the cloud provider can verify user applications through formal proofs.…”

Section: 7mentioning

confidence: 99%

Cybersecurity threats in cloud computing

Jang-Jaccard¹,

Nepal²,

Guo³

2013

ajTDE

View full text Add to dashboard Cite

Recently we have witnessed the emergence of cloud computing as a new computing model that offers resources (e.g., compute, storage, network, etc.) as general utilities to be leased and released on-demand by users through the Internet. Given its innovative nature and reliance on the Internet, the cloud inherently comes with a number of vulnerabilities that increase the space for cyber attacks. This paper aims to provide an overview of major potential risks to privacy and security in the cloud. Various emerging threats and attack methods are discussed, and some speculative future research directions are presented.

show abstract

Compact Proofs of Retrievability

Cited by 1,003 publications

References 11 publications

Verifiable Delegation of Computation over Large Datasets

Verifiable Delegation of Computation over Large Datasets

Survey of Optimized CSP Migration

Cybersecurity threats in cloud computing

Contact Info

Product

Resources

About