English
Related papers

Related papers: Poster: Revocation in VANETs Based on k-ary Huffma…

200 papers

This paper describes a solution for the efficient management of revocation in vehicular ad-hoc networks, for both certificate-based and identity-based authentication. It proposes the use of an authenticated data structure based on a dynamic…

Networking and Internet Architecture · Computer Science 2022-09-27 F Martín-Fernández , P Caballero-Gil , C Caballero-Gil

Revocation of dishonest users is not an easy problem. This paper proposes a new way to manage revocation of pseudonyms in vehicular ad-hoc networks when using identity-based authentication to increase efficiency and security through…

Cryptography and Security · Computer Science 2022-08-11 Pino Caballero-Gil , Francisco Martín-Fernández , Cándido Caballero-Gil

Vehicular Ad hoc Networks is one of the most challenging research area in the field of Mobile Ad Hoc Networks, in this research We propose a flexible, simple, and scalable design for VANET certificates, and new methods for efficient…

Networking and Internet Architecture · Computer Science 2012-06-05 Ghassan Samara

Vehicular Ad hoc Networks is one of the most challenging research area in the field of Mobile Ad Hoc Networks, in this research we propose a flexible, simple, and scalable design for revocation list distribution in VANET, which will reduce…

Networking and Internet Architecture · Computer Science 2010-06-29 Ghassan Samara , Sureswaran Ramadas , Wafaa A. H. Al-Salihy

Among the available communication systems, vehicular networks are emerging as one of the most promising and yet most challenging instantiations of mobile ad-hoc network technologies. The deployment of such networks in large scale requires…

Cryptography and Security · Computer Science 2020-10-27 Andrea Tesei , Domenico Lattuca , Paolo Pagano , Marco Luise , Joaquim Ferreira , Paulo C. Bartolomeu

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…

Information Theory · Computer Science 2013-03-22 Angeline Rao , Ying Liu , Yezhou Feng , Jian Shen

We initiate the study of tree structures in the context of scenario-based robust optimization. Specifically, we study Binary Search Trees (BSTs) and Huffman coding, two fundamental techniques for efficiently managing and encoding data based…

Data Structures and Algorithms · Computer Science 2024-08-22 Spyros Angelopoulos , Christoph Dürr , Alex Elenter , Georgii Melidi

The successful deployment of safe and trustworthy Connected and Autonomous Vehicles (CAVs) will highly depend on the ability to devise robust and effective security solutions to resist sophisticated cyber attacks and patch up critical…

Cryptography and Security · Computer Science 2017-05-22 Giovanni Rigazzi , Andrea Tassi , Robert J. Piechocki , Theo Tryfonas , Andrew Nix

A skeleton Huffman tree is a Huffman tree in which all disjoint maximal perfect subtrees are shrunk into leaves. Skeleton Huffman trees, besides saving storage space, are also used for faster decoding and for speeding up Huffman-shaped…

Data Structures and Algorithms · Computer Science 2020-03-25 Dmitry Kosolobov , Oleg Merkurev

Vehicular ad-hoc networks (VANETs) are one of the most important components in Intelligent Transportation System (ITS), which aims to provide secure and efficient communication between vehicles. Safety-critical vehicular communication…

Cryptography and Security · Computer Science 2021-03-16 Feng Liu , Qi Wang

Advanced Metering Infrastructure forms a communication network for the collection of power data from smart meters in Smart Grid. As the communication between smart meters could be secured utilizing public-key cryptography, however,…

Cryptography and Security · Computer Science 2020-08-07 Mumin Cebe , Kemal Akkaya

In this paper we implement an n-ary Huffman Encoding and Decoding application using different degrees of tree structures. Our goal is to compare the performance of the algorithm in terms of compression ratio, decompression speed and…

Information Theory · Computer Science 2021-05-18 Ioannis S. Xezonakis , Svoronos Leivadaros

In spite of progress in securing Vehicular Communication (VC) systems, there is no consensus on how to distribute Certificate Revocation Lists (CRLs). The main challenges lie exactly in (i) crafting an efficient and timely distribution of…

Cryptography and Security · Computer Science 2018-07-10 Mohammad Khodaei , Panos Papadimitratos

Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called "heterogeneous information networks"…

Social and Information Networks · Computer Science 2018-04-12 Xiaofeng Yang , Deepak Ajwani , Wolfgang Gatterbauer , Patrick K. Nicholson , Mirek Riedewald , Alessandra Sala

Retrieval-augmented generation (RAG) for document-based Open-domain Question Answering (ODQA) on large-scale industrial corpora faces two critical bottlenecks: routing failure in locating the correct document and evidence fragmentation in…

Artificial Intelligence · Computer Science 2026-05-29 Joongmin Shin , Gyuho Shim , Jeongbae Park , Jaehyung Seo , Heuiseok Lim

Mobile Ad-hoc Network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. The conventional security…

Cryptography and Security · Computer Science 2009-10-02 Renuka A. , K. C. Shet

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…

Data Structures and Algorithms · Computer Science 2021-02-03 Tatiana Brailovskaya , Miklós Z. Rácz

The purpose of this paper is two-fold, first, to review a recent method introduced by S. Becker, P. Cheridito, and P. Jentzen, for solving high-dimensional optimal stopping problems using deep Neural Networks, second, to propose an…

Optimization and Control · Mathematics 2023-04-25 Sigurd Assing , Xin Zhi

Vehicular Ad hoc Networks (VANETs) are becoming a reality where secure communication is a prerequisite. Public key infrastructure (PKI) can be used to secure VANETs where an onboard tamper proof device (TPD) stores a number of encryption…

Networking and Internet Architecture · Computer Science 2016-05-17 Ahmed H. Salem , Ayman Abdel-Hamid , Mohamad Abou El-Nasr

Traditional Retrieval-Augmented Generation (RAG) systems employ brute-force inner product search to retrieve the top-k most similar documents, then combined with the user query and passed to a language model. This allows the model to access…

Information Retrieval · Computer Science 2025-06-17 Chia-Heng Yu , Yen-Lung Tsai
‹ Prev 1 2 3 10 Next ›