Paper 2023/1569

Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation

Giuseppe Ateniese, George Mason University
Foteini Baldimtsi, George Mason University
Matteo Campanelli, Matter Labs
Danilo Francati, George Mason University
Ioanna Karantaidou, George Mason University

Proof-of-Replication (PoRep) plays a pivotal role in decentralized storage networks, serving as a mechanism to verify that provers consistently store retrievable copies of specific data. While PoRep’s utility is unquestionable, its implementation in large-scale systems, such as Filecoin, has been hindered by scalability challenges. Most existing PoRep schemes, such as Fisch’s (Eurocrypt 2019), face an escalating number of challenges and growing computational overhead as the number of stored files increases. This paper introduces a novel PoRep scheme distinctively tailored for expansive decentralized storage networks. At its core, our approach hinges on polynomial evaluation, diverging from the probabilistic checking prevalent in prior works. Remarkably, our design requires only a single challenge, irrespective of the number of files, ensuring both prover’s and verifier’s run-times remain manageable even as file counts soar. Our approach introduces a paradigm shift in PoRep designs, offering a blueprint for highly scalable and efficient decentralized storage solutions.

Available format(s)
Cryptographic protocols
Publication info
A minor revision of an IACR publication in CRYPTO 2024
proof of replicationproof of spacepolynomial evaluation
Contact author(s)
ateniese @ gmu edu
foteini @ gmu edu
danilofrancati @ gmail com
ikaranta @ gmu edu
2024-06-04: last of 2 revisions
2023-10-11: received
See all versions
Short URL
Creative Commons Attribution


      author = {Giuseppe Ateniese and Foteini Baldimtsi and Matteo Campanelli and Danilo Francati and Ioanna Karantaidou},
      title = {Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1569},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.