Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
stoRNA: Stateless Transparent Proofs of Storage-time
Tampere University, Finland.
University of Sheffield, UK.
Max Planck Institute, Germany.
RISE Research Institutes of Sweden. Tampere University, Finland.
Show others and affiliations
2024 (English)In: Lect. Notes Comput. Sci., Springer Science and Business Media Deutschland GmbH , 2024, Vol. 14346, p. 389-410Conference paper, Published paper (Refereed)
Abstract [en]

Proof of Storage-time (PoSt) is a cryptographic primitive that enables a server to demonstrate non-interactive continuous availability of outsourced data in a publicly verifiable way. This notion was first introduced by Filecoin to secure their Blockchain-based decentralized 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. 

Place, publisher, year, edition, pages
Springer Science and Business Media Deutschland GmbH , 2024. Vol. 14346, p. 389-410
Keywords [en]
Commerce, Cryptography, Block-chain, Cryptographic primitives, Decentralised, Delay function, Outsourced datum, Pre-processing, Publicly verifiable, Setup costs, Statefulness, Storage time, Digital storage
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-71975DOI: 10.1007/978-3-031-51479-1_20Scopus ID: 2-s2.0-85184130515ISBN: 9783031514784 (electronic)OAI: oai:DiVA.org:ri-71975DiVA, id: diva2:1840656
Conference
28th European Symposium on Research in Computer Security, ESORICS 2023The Hague, Netherlands. 25 September 2023 through 29 September 2023
Available from: 2024-02-26 Created: 2024-02-26 Last updated: 2025-01-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus
By organisation
RISE Research Institutes of Sweden
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 94 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf