论文标题
海报：基于K- Ary Huffman树的Vanets撤销
Poster: Revocation in VANETs Based on k-ary Huffman Trees
论文作者
论文摘要
车辆临时网络的最大问题之一是撤销。该问题的有效管理已成为这一研究领域的主要范式之一。此处提出的解决方案是基于使用经过验证的数据结构（例如撤销树）来替换经典和效率低下的证书撤销列表。特别是，本文的想法是提出使用K-ary哈希树，霍夫曼编码和SHA-3哈希功能的双工版本的使用，以优化在撤销结构中的插入和搜索。因此，在树上撤销了新证书，仅意味着哈希功能的双工结构的新迭代，避免重新计算整个哈希和整个树。此外，使用K-Ary Huffman树插入不同级别的叶子节点，以便那些更查询的撤销的节点靠近根节点位置，因此对于那些在道路上花费更多时间的车辆的撤销证明是较小的。本文详细介绍了一种计算K- ARY树的最佳值$ K $的方法，以优化撤销证明大小。因此，此处描述的建议既改进了撤销结构中新吊销证书的插入，又改进了撤销证书的搜索。本文是正在进行的工作的一部分，因此我们计划在实际场景中实施该方案，以获取参数的理想值，并与其他方案进行比较。
One of the biggest problems of vehicular ad-hoc networks is revocation. The efficient management of such issue has become one of the major paradigms in this area of research. A solution proposed here is based on the use of authenticated data structures like revocation trees to replace the classical and inefficient certificate revocation lists. In particular, the idea of this paper is to propose the use of k-ary hash trees, Huffman coding and a duplex version of the SHA-3 hash function, to optimize insertions and searches in the revocation structure. Thus, the inclusion of a new certificate revoked in the tree, only implies a new iteration of the duplex construction of the hash function, avoiding recalculating the entire hashes and the entire tree. Furthermore, a k-ary Huffman tree is used to insert leaf nodes at different levels so that those revoked nodes that are more queried, are located closer to the root node position, so the revocation proof is smaller for those vehicles that spend more time on the roads. This paper details a method to calculate the optimum value $k$ for the k-ary tree in order to optimize the revocation proof size. Therefore, the proposal described here improves both the insertion of new revoked certificates in the revocation structure and the search of revoked certificates in the revocation structure. This paper is part of a work in progress, so that we plan to implement the scheme in real scenarios to get ideal values of the parameters and comparisons with other schemes.
