Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
3 of
3
Generic Efficient Dynamic Proofs of Retrievability
"... Together with its great advantages, cloud storage brought many interesting security issues to our attention. Since 2007, with the first efficient storage integrity protocols Proofs of Retrievability (PoR) of Juels and Kaliski, and Provable Data Possession (PDP) of Ateniese et al., many researchers w ..."
Abstract
- Add to MetaCart
) was harder than dynamic PDP (DPDP). Historically this was true: The first DPDP scheme was shown by Erway et al. in 2009, whereas the first DPoR scheme was created by Cash et al. in 2013. We show how to obtain DPoR from DPDP and PDP, together with erasure codes, making us realize that even though we did
Locally Updatable and Locally Decodable Codes
, 2013
"... We introduce the notion of locally updatable and locally decodable codes (LULDCs). While, intuitively, updatability and error-correction seem to be contrasting goals, we show that for a suitable, yet meaningful, metric (which we call the Prefix Hamming metric), one can construct such codes. Informal ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
. Finally, we show how our techniques apply to the setting of dynamic proofs of retrievability (DPoR) and show a construction of this primitive with better parameters than existing constructions. In particular, we construct a DPoR scheme with linear storage, O(log k) write complexity, and O(λ log k) read
Locally Updatable and Locally Decodable Codes
"... We introduce the notion of locally updatable and locally decodable codes (LULDCs). In addition to having low decode locality, such codes allow us to update a codeword (of a message) to a codeword of a different message, by rewriting just a few symbols. While, intuitively, updatability and error-corr ..."
Abstract
- Add to MetaCart
parameters than existing constructions. In particular, we construct a DPoR scheme with linear storage, O(log2 k) write complexity, and O(λ log k) read and audit complexity. 1
