Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
From MaRDI portal
Publication:6648200
DOI10.1007/978-3-031-68379-4_1MaRDI QIDQ6648200
Giuseppe Ateniese, Ioanna Karantaidou, Matteo Campanelli, Danilo Francati, Foteini Baldimtsi
Publication date: 4 December 2024
Cites Work
- Unnamed Item
- Dynamic proofs of retrievability via oblivious RAM
- Time-space trade-offs in a pebble game
- Fast rectangular matrix multiplication and applications
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Simple proofs of sequential work
- Verifiable delay functions
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- On the bit-complexity of sparse polynomial and series multiplication
- Multi-point evaluation in higher dimensions
- Proofs of replicated storage without timing assumptions
- Tight proofs of space and replication
- Polynomial evaluation and interpolation on special sets of points
- Compact proofs of retrievability
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Efficiently Computing Data-Independent Memory-Hard Functions
- Proofs of Space: When Space Is of the Essence
- High Parallel Complexity Graphs and Memory-Hard Functions
- The Bitcoin Backbone Protocol: Analysis and Applications
- Constant-Size Commitments to Polynomials and Their Applications
- Proof of Space from Stacked Expanders
- Fast Polynomial Factorization and Modular Composition
- Proofs of Space
- Proofs of Retrievability via Hardness Amplification
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- The truncated fourier transform and applications
- Signatures of Correct Computation
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Pebbling and Proofs of Work
- Algorithms – ESA 2004
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
This page was built for publication: Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
