## On the Cost of Authenticated Data Structures (2003)

Venue: | In Proc. European Symp. on Algorithms, volume 2832 of LNCS |

Citations: | 22 - 12 self |

### BibTeX

@INPROCEEDINGS{Tamassia03onthe,

author = {Roberto Tamassia and Nikos Triandopoulos},

title = {On the Cost of Authenticated Data Structures},

booktitle = {In Proc. European Symp. on Algorithms, volume 2832 of LNCS},

year = {2003},

pages = {2--5},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Authenticated data structures provide a model for data authentication, where answers to queries contain extra information that can produce a cryptographic proof about the validity of the answers. In this paper, we study the authentication cost that is associated with this model when authentication is performed through hierarchical cryptographic hashing. We introduce measures that precisely model the computational overhead that is introduced due to authentication.

### Citations

353 |
A Certified digital signature
- Merkle
- 1990
(Show Context)
Citation Context ...ated by the certificate revocation problem in public key infrastructure and focused on authenticated dictionaries, on which membership queries are performed. The hash tree scheme introduced by Merkle =-=[17,18]-=- can be used to implement a static authenticated dictionary. A hash tree T for a set S stores cryptographic hashes of the elements of S at the leaves of T and a value at each internal node, which is t... |

313 |
Protocols for Public Key Cryptosystems
- Merkle
- 1980
(Show Context)
Citation Context ...ated by the certificate revocation problem in public key infrastructure and focused on authenticated dictionaries, on which membership queries are performed. The hash tree scheme introduced by Merkle =-=[17,18]-=- can be used to implement a static authenticated dictionary. A hash tree T for a set S stores cryptographic hashes of the elements of S at the leaves of T and a value at each internal node, which is t... |

175 | Dynamic accumulators and application to efficient revocation of anonymous credentials
- Camenisch, Lysyanskaya
(Show Context)
Citation Context ...ication schemes that use a one-way, collision-resistant cryptographic hash function, which will be referred to as hash function for brevity. The alternative technique of one-way accumulators, used in =-=[3, 10]-=-, is significantly less efficient in practice. Let S be a data set owned by the source. We use a hash function h to produce a digest of set S, which is signed by the source. The digest is computed thr... |

149 | Certificate revocation and certificate update
- Naor, Nissim
- 1998
(Show Context)
Citation Context ...he hash tree uses linear space and has O(log n) proof size, query time and verification time. A dynamic authenticated dictionary based on hash trees that achieves O(log n) update time is described in =-=[19]-=-. A dynamic authenticated dictionary that uses a hierarchical hashing technique over skip lists is presented in [9]. This data structure also achieves O(log n) proof size, query time, update time and ... |

91 |
On certificate revocation and validation
- KOCHER
- 1998
(Show Context)
Citation Context ... lists is presented in [9]. This data structure also achieves O(log n) proof size, query time, update time and verification time. Other schemes based on variations of hash trees have been proposed in =-=[2,6,13]-=-. A detailed analysis of the efficiency of authenticated dictionary schemes based on hierarchical cryptographic hashing is conducted in [22], where precise measures of the computational overhead due t... |

80 | Authentic third-party data publication
- Devanbu, Gertz, et al.
- 2000
(Show Context)
Citation Context ...re the user can issue historical queries of the type “was element e in set S at time t”. A first step towards the design of more general authenticated data structures (beyond dictionaries) is made=-= in [5]-=- with the authentication of relational database operations and multidimensional orthogonal range queries. In [16], a general method for designing authenticated data structures using hierarchical hashi... |

70 | Implementation of an authenticated dictionary with skip lists and commutative hashing
- Goodrich, Tammassia, et al.
- 2001
(Show Context)
Citation Context ...nique for authenticating data structures that follow the fractional cascading paradigm. The software architecture and implementation of an authenticated dictionary based on skip lists is presented in =-=[11]-=-. A distributed system realizing an authenticated dictionary, is described in [7]. This paper also provides an empirical analysis of the performance of the system in various deployment scenarios. The ... |

65 | Flexible authentication of XML documents
- DEVANBU, GERTZ, et al.
- 2001
(Show Context)
Citation Context ...stigated in [20]. Prooflets, a scalable architecture for authenticating web content based on authenticated dictionaries, are introduced in [24]. Work related to authenticated data structures includes =-=[3, 4, 8, 14, 15]-=-. Skip lists were introduced in [21, 22] where it is shown that the expected number of comparisons 1 for a search is (log2 n)/(p log2 ) + O(1), where p is a probability parameter. An improved skip lis... |

61 | Secure history preservation through timeline entanglement - Maniatis, Baker - 2002 |

57 | Persistent authenticated dictionaries and their applications
- Anagnostopoulos, Goodrich, et al.
(Show Context)
Citation Context ...[10]. This technique achieves constant proof size and verification time and provides a tradeoff between the query and update times. For example, one can achieve O( √ n) query time and update time. I=-=n [1], th-=-e notion of a persistent authenticated dictionary is introduced, where the user can issue historical queries of the type “was element e in set S at time t”. A first step towards the design of more... |

46 | Authenticated data structures for graph and geometric searching
- Goodrich, Tamassia, et al.
- 2003
(Show Context)
Citation Context ...variety of fundamental search problems on graphs (e.g., path queries and biconnectivity queries) and geometric objects (e.g., point location queries and segment intersection queries) are presented in =-=[12]-=-. This paper also provides a general technique for authenticating data structures that follow the fractional cascading paradigm. The software architecture and implementation of an authenticated dictio... |

40 | An efficient dynamic and distributed cryptographic accumulator
- Goodrich, Tamassia, et al.
- 2002
(Show Context)
Citation Context ...on scheme is presented that achieve performance very close to the theoretical optimal. An alternative approach to the design of authenticated dictionary, based on the RSA accumulator, is presented in =-=[10]-=-. This technique achieves constant proof size and verification time and provides a tradeoff between the query and update times. For example, one can achieve O( √ n) query time and update time. In [1],... |

39 | Accountable certificate management using undeniable attestations
- Buldas, Laud, et al.
(Show Context)
Citation Context ... lists is presented in [9]. This data structure also achieves O(log n) proof size, query time, update time and verification time. Other schemes based on variations of hash trees have been proposed in =-=[2, 6, 13]-=-. The software architecture and implementation of an authenticated dictionary based on skip lists is presented in [11]. 3sAn alternative approach to the design of authenticated dictionary, based on th... |

35 | Enabling the archival storage of signed documents - Maniatis, Baker - 2002 |

27 | Efficient authenticated dictionaries with skip lists and commutative hashing
- Goodrich, Tamassia
- 2000
(Show Context)
Citation Context ...d dictionary based on hash trees that achieves O(log n) update time is described in [19]. A dynamic authenticated dictionary that uses a hierarchical hashing technique over skip lists is presented in =-=[9]-=-. This data structure also achieves O(log n) proof size, query time, update time and verification time. Other schemes based on variations of hash trees have been proposed in [2,6,13]. A detailed analy... |

26 | Efficient and fresh certification
- Gassko, Gemmell, et al.
- 2000
(Show Context)
Citation Context ... lists is presented in [9]. This data structure also achieves O(log n) proof size, query time, update time and verification time. Other schemes based on variations of hash trees have been proposed in =-=[2,6,13]-=-. A detailed analysis of the efficiency of authenticated dictionary schemes based on hierarchical cryptographic hashing is conducted in [22], where precise measures of the computational overhead due t... |

12 | Authenticating distributed data using web services and xml signatures
- Polivy
- 2002
(Show Context)
Citation Context ...r also provides an empirical analysis of the performance of the system in various deployment scenarios. The authentication of distributed data using web services and XML signatures is investigated in =-=[20]-=-. Prooflets, a scalable architecture for authenticating web content based on authenticated dictionaries, are introduced in [21]. Work related to authenticated data structures includes [3,4,8,14,15]. A... |

11 | Authenticated dictionaries for fresh attribute credentials - Goodrich, Shin, et al. |

11 | A general model for authentic data publication
- Martel, Nuckolls, et al.
- 2001
(Show Context)
Citation Context ...e design of more general authenticated data structures (beyond dictionaries) is made in [5] with the authentication of relational database operations and multidimensional orthogonal range queries. In =-=[16]-=-, a general method for designing authenticated data structures using hierarchical hashing over a search graph is presented. This technique is applied to the design of static authenticated data structu... |

4 |
Authenticating Web content with prooflets
- Shin, Straub, et al.
- 2002
(Show Context)
Citation Context ...istributed data using web services and XML signatures is investigated in [20]. Prooflets, a scalable architecture for authenticating web content based on authenticated dictionaries, are introduced in =-=[21]-=-. Work related to authenticated data structures includes [3,4,8,14,15]. Acknowledgements. I would like to thank Michael Goodrich for his research collaboration on authenticated data structures. This w... |

2 |
Design and implementation of a distributed authenticated dictionary and its applications
- Goodrich, Lentini, et al.
- 2002
(Show Context)
Citation Context ...digm. The software architecture and implementation of an authenticated dictionary based on skip lists is presented in [11]. A distributed system realizing an authenticated dictionary, is described in =-=[7]-=-. This paper also provides an empirical analysis of the performance of the system in various deployment scenarios. The authentication of distributed data using web services and XML signatures is inves... |