Paper 2018/514
Weak Compression and (In)security of Rational Proofs of Storage
Ben Fisch and Shashwat Silas
Abstract
We point out an implicit unproven assumption underlying the security of rational proofs of storage that is related to a concept we call weak randomized compression. This is a class of interactive proofs designed in a security model with a rational prover who is encouraged to store data (possibly in a particular format), as otherwise it either fails verification or does not save any storage costs by deviating (in some cases it may even increase costs by ``wasting" the space).
Weak randomized compression is a scheme that takes a random seed
Note: Put in a missing sentence.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- information theoryproofs of storagerational security
- Contact author(s)
- benafisch @ gmail com
- History
- 2018-05-27: received
- Short URL
- https://ia.cr/2018/514
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/514, author = {Ben Fisch and Shashwat Silas}, title = {Weak Compression and (In)security of Rational Proofs of Storage}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/514}, year = {2018}, url = {https://eprint.iacr.org/2018/514} }