[Resource Topic] 2023/515: stoRNA: Stateless Transparent Proofs of Storage-time

Welcome to the resource topic for 2023/515

Title:
stoRNA: Stateless Transparent Proofs of Storage-time

Authors: Reyhaneh Rabaninejad, Behzad Abdolmaleki, Giulio Malavolta, Antonis Michalas, Amir Nabizadeh

Abstract:

Proof of Storage-time (PoSt) is a cryptographic primitive
that enables a server to demonstrate non-interactive continuous avail-
ability of outsourced data in a publicly verifiable way. This notion was
first introduced by Filecoin to secure their Blockchain-based decentral-
ized storage marketplace, using expensive SNARKs to compact proofs.
Recent work [2] employs the notion of trapdoor delay function to address
the problem of compact PoSt without SNARKs. This approach however
entails statefulness and non-transparency, while it requires an expensive
pre-processing phase by the client. All of the above renders their solution
impractical for decentralized storage marketplaces, leaving the stateless
trapdoor-free PoSt with reduced setup costs as an open problem. In
this work, we present stateless and transparent PoSt constructions using
probabilistic sampling and a new Merkle variant commitment. In the
process of enabling adjustable prover difficulty, we then propose a multi-
prover construction to diminish the CPU work each prover is required to
do. Both schemes feature a fast setup phase and logarithmic verification
time and bandwidth with the end-to-end setup, prove, and verification
costs lower than the existing solutions

ePrint: https://eprint.iacr.org/2023/515

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .