Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is maintained by a remote host. We present techniques for authenticating data structures that represent graphs and collections of geometric objects. In our model, a data structure maintained by a trusted source is mirrored at distributed directories that answer queries and provide proof of correctness. Our work has applications to the authentication of network management systems and geographic information systems. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Goodrich, M. T., Tamassia, R., Triandopoulos, N., & Cohen, R. (2003). Authenticated data structures for graph and geometric searching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2612, 295–313. https://doi.org/10.1007/3-540-36563-x_20
Mendeley helps you to discover research relevant for your work.