English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

One of the biggest problems of vehicular ad-hoc networks is revocation. Theefficient management of such issue has become one of the major paradigms inthis area of research. A solution proposed here is based on the use ofauthenticated data structures like revocation trees to replace the classicaland inefficient certificate revocation lists. In particular, the idea of thispaper is to propose the use of k-ary hash trees, Huffman coding and a duplexversion of the SHA-3 hash function, to optimize insertions and searches in therevocation structure. Thus, the inclusion of a new certificate revoked in thetree, only implies a new iteration of the duplex construction of the hashfunction, avoiding recalculating the entire hashes and the entire tree.Furthermore, a k-ary Huffman tree is used to insert leaf nodes at differentlevels so that those revoked nodes that are more queried, are located closer tothe root node position, so the revocation proof is smaller for those vehiclesthat spend more time on the roads. This paper details a method to calculate theoptimum value $k$ for the k-ary tree in order to optimize the revocation proofsize. Therefore, the proposal described here improves both the insertion of newrevoked certificates in the revocation structure and the search of revokedcertificates in the revocation structure. This paper is part of a work inprogress, so that we plan to implement the scheme in real scenarios to getideal values of the parameters and comparisons with other schemes.

Poster: Revocation in VANETs Based on k-ary Huffman Trees