Proofs of replicated storage without timing assumptions

DOI10.1007/978-3-030-26948-7_13MaRDI QIDQ2181856zbMATH OpenOpenAlexFDO

Authors Chaya Ganesh, Claudio Orlandi, Ivan B. Damgård

Publication date 20 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26948-7_13

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• New techniques in replica encodings with client setup
• Simple proofs of space-time and rational proofs of storage
• Tight proofs of space and replication
• Proofs of storage: theory, constructions and applications
• Compact proofs of retrievability

Cited in

(11)

• Incompressible encodings
• New techniques in replica encodings with client setup
• Simple proofs of space-time and rational proofs of storage
• Advances in Cryptology – CRYPTO 2004
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
• Rate-1 incompressible encryption from standard assumptions
• stoRNA: stateless transparent proofs of storage-time
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• Non-committing identity based encryption: constructions and applications
• Incompressible encryption with everlasting security
• Wait-free regular storage from Byzantine components

This page was built for publication: Proofs of replicated storage without timing assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181856)