Authenticated data structures, generically
From MaRDI portal
Recommendations
Cited in
(14)- A general model for authenticated data structures
- Balloon: a forward-secure append-only persistent authenticated data structure
- An alternative approach to public cloud data auditing supporting data dynamics
- Authenticated hash tables based on cryptographic accumulators
- Merkle trees optimized for stateless clients in bitcoin
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Computing on Authenticated Data
- Optimal authenticated data structures with multilinear forms
- scientific article; zbMATH DE number 1962158 (Why is no real title available?)
- scientific article; zbMATH DE number 2044545 (Why is no real title available?)
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Generic Authenticated Data Structures, Formally.
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
This page was built for publication: Authenticated data structures, generically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408436)