Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
From MaRDI portal
Publication:5452276
DOI10.1007/978-3-540-77048-0_1zbMath1285.94110OpenAlexW1593549950MaRDI QIDQ5452276
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
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (5)
Database Outsourcing with Hierarchical Authenticated Data Structures ⋮ Vector Commitments and Their Applications ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Super-Efficient Verification of Dynamic Outsourced Databases ⋮ Authenticated hash tables based on cryptographic accumulators
This page was built for publication: Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
