Proofs of Retrievability via Hardness Amplification
作者： Yevgeniy Dodis , Salil Vadhan , Daniel Wichs
DOI: 10.1007/978-3-642-00457-5_8
关键词: Communication complexity 、 Coding (social sciences) 、 Retrievability 、 Random oracle 、 Security parameter 、 Computer science 、 Mathematical proof 、 Theoretical computer science
摘要: … , this is only intuition and our actual proof needs to work the other way — given an adversarial server that responds correctly with probability ε>δt, we need to decode the original file. …
springer.com
harvard.edu 
acm.org 
core.ac.uk 
sci-hub.st 参考文章(17)
Oded Goldreich, A Sample of Samplers - A Computational Perspective on Sampling (survey). Electronic Colloquium on Computational Complexity. ,vol. 4, ,(1997)
Hovav Shacham, Brent Waters, Compact Proofs of Retrievability international conference on the theory and application of cryptology and information security. pp. 90- 107 ,(2008) , 10.1007/978-3-540-89255-7_7
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson, Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized SIAM Journal on Computing. ,vol. 39, pp. 1637- 1665 ,(2010) , 10.1137/080734030
Russell Impagliazzo, Avi Wigderson, P = BPP if E requires exponential circuits: derandomizing the XOR lemma symposium on the theory of computing. pp. 220- 229 ,(1997) , 10.1145/258533.258590
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification foundations of computer science. ,vol. 39, pp. 187- 196 ,(2006) , 10.1109/FOCS.2006.13
Kevin D. Bowers, Ari Juels, Alina Oprea, Proofs of retrievability: theory and implementation ieee international conference on cloud computing technology and science. pp. 43- 54 ,(2009) , 10.1145/1655008.1655015
Leonid A. Levin, Problems, complete in “average” instance symposium on the theory of computing. pp. 465- ,(1984) , 10.1145/800057.808713
Andrew C Yao, None, Theory and application of trapdoor functions foundations of computer science. pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.95
Ari Juels, Burton S. Kaliski, Pors: proofs of retrievability for large files computer and communications security. pp. 584- 597 ,(2007) , 10.1145/1315245.1315317
Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary Peterson, Dawn Song, Provable data possession at untrusted stores computer and communications security. pp. 598- 609 ,(2007) , 10.1145/1315245.1315318