A general model for authenticated data structures
From MaRDI portal
Recommendations
Cited in
(19)- Integrity and consistency for untrusted services (extended abstract)
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Efficient Content Authentication in Peer-to-Peer Networks
- Computing on Authenticated Data
- Database outsourcing with hierarchical authenticated data structures
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Data and Applications Security XIX
- Super-Efficient Verification of Dynamic Outsourced Databases
- Automata, Languages and Programming
- Vector commitments and their applications
- Secure authenticated comparisons
- Non-malleable vector commitments via local equivocability
- scientific article; zbMATH DE number 1962158 (Why is no real title available?)
- scientific article; zbMATH DE number 2044545 (Why is no real title available?)
- Non-malleable vector commitments via local equivocability
- Authenticated hash tables based on cryptographic accumulators
- Authentic third-party data publication
- Authenticated data structures, generically
- Balloon: a forward-secure append-only persistent authenticated data structure
This page was built for publication: A general model for authenticated data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879358)