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

DOI10.1007/978-3-540-77048-0_1zbMATH Open1285.94110OpenAlexW1593549950MaRDI QIDQ5452276FDOQ5452276

Roberto Tamassia, Charalampos Papamanthou

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Authenticated hash tables based on cryptographic accumulators
• Super-Efficient Verification of Dynamic Outsourced Databases
• Efficient authenticated data structures for graph connectivity and geometric search problems
• Limits on revocable proof systems, with implications for stateless blockchains
• Database Outsourcing with Hierarchical Authenticated Data Structures
• Privacy-preserving authentication for tree-structured data with designated verification in outsourced environments
• Vector Commitments and Their Applications

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)