Authenticated data structures for graph and geometric searching

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert Cohen

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

47 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMarc Joye
Pages295-313
Number of pages19
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2612
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Authenticated data structures for graph and geometric searching'. Together they form a unique fingerprint.

Cite this