Skip to main content
Journal Article

Authenticated data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2832 2-5
DOI: 10.1007/978-3-540-39658-1_2
126Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Authenticated data structures are a model of computation where untrusted responders answer queries on a data structure on behalf of a trusted source and provide a proof of the validity of the answer to the user. We present a survey of techniques for designing authenticated data structures and overview their computational efficiency. We also discuss implementation issues and practical applications. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Tamassia, R. (2003). Authenticated data structures. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 2–5. https://doi.org/10.1007/978-3-540-39658-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free