Proofs of Retrievability via Hardness Amplification
Open Access
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2009, 109-127
- https://doi.org/10.1007/978-3-642-00457-5_8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Proofs of retrievabilityPublished by Association for Computing Machinery (ACM) ,2009
- Proofs of Retrievability via Hardness AmplificationLecture Notes in Computer Science, 2009
- Compact Proofs of RetrievabilityLecture Notes in Computer Science, 2008
- PorsPublished by Association for Computing Machinery (ACM) ,2007
- Provable data possession at untrusted storesPublished by Association for Computing Machinery (ACM) ,2007
- The Complexity of Online Memory CheckingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- List-decoding using the XOR lemmaPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Hard-core distributions for somewhat hard problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- P = BPP if E requires exponential circuitsPublished by Association for Computing Machinery (ACM) ,1997
- One way functions and pseudorandom generatorsCombinatorica, 1987