Computer Science – Cryptography and Security
Scientific paper
2009-08-28
Computer Science
Cryptography and Security
Full version of related paper appearing in CT-RSA 2003
Scientific paper
Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is being controlled by a remote untrusted host. We present efficient techniques for authenticating data structures that represent graphs and collections of geometric objects. We introduce the path hash accumulator, a new primitive based on cryptographic hashing for efficiently authenticating various properties of structured data represented as paths, including any decomposable query over sequences of elements. We show how to employ our primitive to authenticate queries about properties of paths in graphs and search queries on multi-catalogs. This allows the design of new, efficient authenticated data structures for fundamental problems on networks, such as path and connectivity queries over graphs, and complex queries on two-dimensional geometric objects, such as intersection and containment queries.
Goodrich Michael T.
Tamassia Roberto
Triandopoulos Nikos
No associations
LandOfFree
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-192870