Pors
Ari Juels, Burton S. Kaliski · Proceedings of the ACM Conference on Computer and Communications Security · 2007
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Cited by 1,894 works. doi:10.1145/1315245.1315317
Authors
References
- The Knowledge Complexity of Interactive Proof Systems
- Efficient dispersal of information for security, load balancing, and fault tolerance
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Provable data possession at untrusted stores
- Raptor codes
- On interprocess communication
- Replication is not needed: single database, computationally-private information retrieval
- Raptor Codes
- Proofs of Work and Bread Pudding Protocols
- On Defining Proofs of Knowledge