Proofs of Retrievability via Hardness Amplification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5444 LNCS, Issue , 2009, Pages 109-127

  Dodis, Yevgeniy ^a   Vadhan, Salil ^b   Wichs, Daniel ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUDIT PROTOCOL; COMMUNICATION COMPLEXITY; COMPLEXITY THEORY; HARDNESS AMPLIFICATION; INFORMATION-THEORETIC SECURITY; RANDOM ORACLE; SECURITY PARAMETERS; SIMPLE CONNECTIONS; SIMPLIFYING ASSUMPTIONS; UNTRUSTED SERVER;

BUILDING CODES; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; HARDNESS; INFORMATION THEORY; OPTIMIZATION;

AMPLIFICATION;

EID: 70350681128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_8     Document Type: Conference Paper

References (16)

1. Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z.N.J., Song, D.X.: Provable data possession at untrusted stores. In: Ning, et al. (eds.) [NdVS07], pp. 598-609 (2007)
2. Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: Theory and implementation. Cryptology ePrint Archive, Report 2008/175 (2008), http://eprint.iacr.org/
3. Dodis, Y., Vadhan, S.,Wichs, D.: Proofs of retrievability via hardness amplification (full version). Cryptology ePrint Archive (2009), http://eprint.iacr.org/
4. Goldreich, O., Nisan, N., Wigderson, A.: On yao's xor-lemma. Electronic Colloquium on Computational Complexity (ECCC) 2(50) (1995)
5. Goldreich, O.: A sample of samplers - a computational perspective on sampling (survey). Electronic Colloquium on Computational Complexity (ECCC) 4(20) (1997)
6. Impagliazzo, R., Jaiswal, R., Kabanets, V.: Approximately list-decoding direct product codes and uniform hardness amplification. In: FOCS, pp. 187-196. IEEE Computer Society, Los Alamitos (2006)
7. Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Uniform direct product theorems: simplified, optimized, and derandomized. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 579-588. ACM, New York (2008)
8. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS, pp. 538-545 (1995)
9. Impagliazzo, R., Wigderson, A.: P = BPP if EXP requires exponential circuits: Derandomizing the xor lemma. In: STOC, pp. 220-229 (1997)
10. Juels, A., Kaliski, B.S.: Pors: proofs of retrievability for large files. In: Ning, et al. (eds.) [NdVS07], pp. 584-597 (2007)
11. Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357-363 (1987)
12. Ning, P., De Capitani di Vimercati, S., Syverson, P.F.: Proceedings of the 2007 ACMConference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007. ACM, New York (2007)
13. Naor, M., Rothblum, G.N.: The complexity of online memory checking. In: FOCS, pp. 573-584 (2005)
14. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)
15. Trevisan, L.: List-decoding using the xor lemma. In: FOCS, pp. 126-135. IEEE Computer Society, Los Alamitos (2003)
16. Chi-Chih Yao, A.: Theory and applications of trapdoor functions (extended abstract). In: FOCS, pp. 80-91. IEEE, Los Alamitos (1982)