Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures

DOI10.1007/978-3-540-77048-0_1MaRDI QIDQ5452276zbMATH OpenOpenAlexFDO

Authors Charalampos Papamanthou, Roberto Tamassia

Publication date 25 March 2008

Published in Information and Communications Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77048-0_1

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Database outsourcing with hierarchical authenticated data structures
• scientific article; zbMATH DE number 1962158
• Authenticated hash tables based on cryptographic accumulators
• A general model for authenticated data structures
• Authenticated data structures, generically

Cited in

(8)

• Authenticated hash tables based on cryptographic accumulators
• scientific article; zbMATH DE number 1962158 (Why is no real title available?)
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Super-Efficient Verification of Dynamic Outsourced Databases
• Limits on revocable proof systems, with implications for stateless blockchains
• Vector commitments and their applications
• Database outsourcing with hierarchical authenticated data structures
• Privacy-preserving authentication for tree-structured data with designated verification in outsourced environments

This page was built for publication: Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures

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