Accountable storage
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Compact Proofs of Retrievability
- Dynamic proofs of retrievability via oblivious RAM
- Efficient Two-Party Secure Computation on Committed Inputs
- LEGO for Two-Party Secure Computation
- MiniLEGO: efficient secure two-party computation from general assumptions
- Modeling Bitcoin contracts by timed automata
- Revisiting the Efficiency of Malicious Two-Party Computation
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Space/time trade-offs in hash coding with allowable errors
- Universal classes of hash functions
Cited in
(6)- Privacy-preserving accountable computation
- stoRNA: stateless transparent proofs of storage-time
- \textsf{Reparo}: publicly verifiable layer to repair blockchains
- Invertible Bloom lookup tables with less memory and randomness
- \textsc{VeriCount}: verifiable resource accounting using hardware and software isolation
- Senarai: a sustainable public blockchain-based permanent storage protocol
This page was built for publication: Accountable storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487222)
