Goodrich, M., Tamassia, R., Triandopoulos, N. and Cohen, R. (2003) Authenticated Data Structures for Graph and Geometric Searching. CT-RSA. LNCS 2612, 295-313.

has been cited by the following article:

• TITLE: Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

  AUTHORS: Pino Caballero-Gil, Francisco Martín-Fernández, Cándido Caballero-Gil

  KEYWORDS: K-Ary Tree, Identity-Based Cryptography, Revocation, Hash Function, Vehicular Ad-Hoc Network

  JOURNAL NAME: Journal of Computer and Communications, Vol.2 No.9, July 11, 2014

  ABSTRACT: This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.