Limits on revocable proof systems, with implications for stateless blockchains
From MaRDI portal
Recommendations
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Proof of necessary work: succinct state verification with fairness guarantees
- Aggregatable subvector commitments for stateless cryptocurrencies
- KVaC: key-value commitments for blockchains and beyond
- Merkle trees optimized for stateless clients in bitcoin
Cites work
- A Mathematical Theory of Communication
- Achieving almost all blockchain functionalities with polylogarithmic storage
- Aggregatable subvector commitments for stateless cryptocurrencies
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- scientific article; zbMATH DE number 2089751 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- On the impossibility of batch update for cryptographic accumulators
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Vector commitments and their applications
Cited in
(2)
This page was built for publication: Limits on revocable proof systems, with implications for stateless blockchains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573990)
