Vehicle Communication using Hash Chain-based Secure Cluster
Authors: Na-Young Ahn, Dong Hoon Lee
AI-generated Key Points
- Introduction of a novel approach to secure vehicle communication using hash chain-based secure clusters
- Concept of a secure cluster, which refers to a group of vehicles with high vehicular secrecy capacity
- Proposal that enabling vehicle communication within a secure cluster can achieve secure vehicle communication
- Creation of secure hash clusters through the sharing of hash chains derived from vehicle identification numbers
- Emphasis on the significance of the research in the context of future autonomous vehicles and Mobile Edge Computing (MEC)
- Essential role in enabling strong and safe vehicle communications during the implementation of autonomous driving
- Innovative solution for enhancing security and efficiency in vehicle communication
- Promise for robust and reliable communication among vehicles, contributing to advancements in autonomous driving technologies.
Abstract: We introduce a hash chain-based secure cluster. Here, secure cluster refers to a set of vehicles having vehicular secrecy capacity of more than a reference value. Since vehicle communication is performed in such a secure cluster, basically secure vehicle communication can be expected. Secure hash clusters can also be expected by sharing hash chains derived from vehicle identification numbers. We are also convinced that our paper is essential for future autonomous vehicles by providing secure clustering services using MEC. In the near term, autonomous driving, our paper makes it possible to expect strong and practically safe vehicle communications.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.