No Marshmallows, Just Term Papers
 “Ensuring data storage security in cloud computing,”
Author: C. Wang, Q. Wang, K. Ren, W. Lou,
Year of publication: July 2009
In this paper, an effective and flexible distributed scheme is proposed. By utilizing the homomorphic token with distributed verification of erasure-coded data, this scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). The new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. The proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks.
* Challenge-response protocol.
* Provides data security.
* In this paper, distributed schemes are aware of dynamic data operations. As a result, their applicability in cloud data storage can be drastically limited.
* Storage correctness is not assured.
* Third party auditing is not introduced.
* Authentication handshakes are used.
* Data privacy is not guaranteed.
* Data correctness is not analyzed.
* The probability of data modified is not detected.
“Pors: Proofs of retrievability for large files”
Author: A. Juels and J. Burton S. Kaliski
Year of publication: October 2007, pp. 584–597.
In this paper, we develop a new cryptographic building block known as a proof of retrievability (POR). A POR enables a user (verifier) to determine that an archive (prover) “possesses” a file ordata object F. More precisely, a successfully executed POR assures a verifier that the prover presentsa protocol interface through which the verifier can retrieve F in its entirety. Of course, a prover canrefuse to release F even after successfully participating in a POR. A POR, however, provides thestrongest possible assurance of file retrievability barring changes in prover...
Join now to view this essay and thousands of others on PaperCamp.com. It's free Join Now!