Automata, Languages and Programming
From MaRDI portal
Publication:5716770
DOI10.1007/11523468zbMath1082.68573OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716770
Nikos Triandopoulos, Roberto Tamassia
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items
Cost of multicast logical key tree based on hierarchical data processing ⋮ Analysis of Multivariate Hash Functions ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Super-Efficient Verification of Dynamic Outsourced Databases ⋮ Integrity and Consistency for Untrusted Services ⋮ Secure Key-Updating for Lazy Revocation ⋮ Authenticated hash tables based on cryptographic accumulators
