2014
DOI: 10.1007/978-3-642-54242-8_21
|View full text |Cite
|
Sign up to set email alerts
|

Locally Updatable and Locally Decodable Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(50 citation statements)
references
References 26 publications
0
50
0
Order By: Relevance
“…We show how VOS can be useful in Dynamic Proofs of Retrievability, based on the results of Cash et al [9]. We note that two recent results have yielded more practical dynamic PoR schemes [10,32]. Our dynamic PoR description helps demonstrate why distinguishing between VOS and ORAM can aid theoretical understanding.…”
Section: Applications: Efficient Dynamic Proofs Of Retrievabilitymentioning
confidence: 78%
See 1 more Smart Citation
“…We show how VOS can be useful in Dynamic Proofs of Retrievability, based on the results of Cash et al [9]. We note that two recent results have yielded more practical dynamic PoR schemes [10,32]. Our dynamic PoR description helps demonstrate why distinguishing between VOS and ORAM can aid theoretical understanding.…”
Section: Applications: Efficient Dynamic Proofs Of Retrievabilitymentioning
confidence: 78%
“…Our dynamic PoR description helps demonstrate why distinguishing between VOS and ORAM can aid theoretical understanding. For a practical implementation, the recent schemes by Shi et al [32] and Chandran et al [10] are recommended.…”
Section: Applications: Efficient Dynamic Proofs Of Retrievabilitymentioning
confidence: 99%
“…As a lower bound, if everyone used these ASICs, then at least $80 million dollars has been spent on equipment. 7 If this infrastructure investment were entirely redirected toward SSD drives, assuming $70 for 100GB, the result would be a total network storage capacity of 100 petabytes. The cost-density of RAM is lower ($20 for 2 gigabytes); given an approximately equal investment in hashing devices to saturate it, the result would be an overall network storage capacity of 4 petabytes.…”
Section: Parameterization and Microbenchmarksmentioning
confidence: 99%
“…In the computational setting, there has been a sequence of works on improving the rate of error-correcting codes [27,29,30,23,22,8] as well as constructing non-malleable codes and its variants [28,19]. We also note that for the case of bit-wise tampering functions, a hybrid approach was suggested in [18] by relying on authenticated encryption.…”
Section: Prior Workmentioning
confidence: 99%
“…Ideally, we would like to achieve codewords with minimum number of states k = 2 while tolerating all possible tampering functions and achieving high-rate. 8 In a break-through result, Aggarwal, Dodis, and Lovett [3] presented an explicit non-malleable code for k = 2 states for messages of arbitrary length (significantly improving upon [17] which only encodes a single bit). However, their work only achieves rate Ω(n −6/7 ) (or rate 0, asymptotically) where n is the block length of the codeword.…”
Section: Introductionmentioning
confidence: 99%