Skip to main content
Conference ProceedingsOPEN ACCESS

Authenticated relational tables and authenticated skip lists

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4602 LNCS 31-46
DOI: 10.1007/978-3-540-73538-0_3
24Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a general method, based on the usage of typical DBMS primitives, for maintaining authenticated relational tables. The authentication process is managed by an application external to the DBMS, that stores just one hash information of the authentication structure. The method exploits techniques to represent hierarchical data structures into relational tables and queries that allow an efficient selection of the elements needed for authentication. © IFIP International Federation for Information Processing 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Di Battista, G., & Palazzi, B. (2007). Authenticated relational tables and authenticated skip lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4602 LNCS, pp. 31–46). Springer Verlag. https://doi.org/10.1007/978-3-540-73538-0_3

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