Sihyung Lee

Dr. Sihyung Lee

Kyungpook National University, Daegu, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 March 2022 in Sensors
Verified
Journal Article
Open access
PDF file
AMAbdul Mateen
Abdul Mateen
ZHZahid Hanif
Zahid Hanif
Narayan KhatriNarayan Khatri
Narayan Khatri
Sihyung LeeSihyung Lee
Sihyung Lee
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
An increasing number of vehicles on the roads increases the risk of accidents. In bad weather (e.g., heavy rainfall, strong winds, storms, and fog), this risk almost doubles due to bad visibility as well as road conditions. If an accident happens, especially in bad weather, it is important to inform approaching vehicles about it. Otherwise, there might be another accident, i.e., a multiple-vehicle collision (MVC). If the Emergency Operations Center (EOC) is not informed in a timely fashion about the incident, fatalities might increase because they do not receive immediate first aid. Detecting humans or animals would undoubtedly provide us with a better answer for reducing human fatalities in traffic accidents. In this research, an accident alert light and sound (AALS) system is proposed for auto accident detection and alerts with all types of vehicles. No changes are required in non-equipped vehicles (nEVs) and EVs because the system is installed on the roadside. The idea behind this research is to make smart roads (SRs) instead of equipping each vehicle with a separate system. Wireless communication is needed only when an accident is detected. This study is based on different sensors that are used to build SRs to detect accidents. Pre-saved locations are used to reduce the time needed to find the accident’s location without the help of a global positioning system (GPS). Additionally, the proposed framework for the AALS also reduces the risk of MVCs.

27 October 2023 in IEEE Access
Verified
Journal Article
Open access
NKNarayan Khatri
Narayan Khatri
Sihyung LeeSihyung Lee
Sihyung Lee
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
The Controller Area Network (CAN) is a major protocol for in-vehicle network communications. This protocol is simple and efficient for message transmission and the smooth functioning of an in-vehicle system. On the other hand, the weaknesses of this protocol, such as the ID-based arbitration method for message transmission and lack of authentication mechanism, make it vulnerable to various security attacks, including DoS attacks, Fuzzy attacks, impersonation attacks, and replay attacks. Since there is no authentication mechanism for transmitted messages, we need a way to distinguish between normal and attack messages. An intrusion detection system (IDS) is an option for this problem because it can raise alarms when there are flaws in the system. IDS is very efficient for intrusion detection where messages with the same IDs are transmitted periodically. The deviation from the normal pattern of message transmission will force the IDS system to trigger alarms. Most studies on the CAN bus IDS system were based on a supervised learning approach. On the other hand, the lack of labeled datasets and a huge amount of training time make it inefficient for new attack patterns. This paper proposes a transfer learning-based IDS system for in-vehicle network intrusion detection. The extraction of quality features using transfer learning (TL) and appropriate fine-tuning methodology is used in the proposed model. This approach can use the available intrusion attack dataset to detect new attacks. The experimental results indicated that the proposed deep hybrid transfer learning (TL) model detects new threats with a high accuracy of approximately 99.9% when compared to state-of-the-art methods, while also lowering training and testing time by more than 30%.

10 March 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
AMAbdul Mateen
Abdul Mateen
AKAdia Khalid
Adia Khalid
Sihyung LeeSihyung Lee
Sihyung Lee
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
Despite the rapid expansion in the insurance industry, many issues remain unresolved and may require immediate action. As the insurance sector continues to evolve with the development of new technologies, it faces more challenges, especially related to data security and fraud. The fraud-prevention data and tactics presently used by insurance firms are outdated and ineffective. Additionally, insurance firms have traditionally handled the settlement of all consumer claims through lengthy manual processes. These manual processes need to be changed to provide opportunities for insurance businesses to grow. In the case of vehicles, the information obtained from an automobile data recorder can be used as evidence. Data from automated vehicles are critical because they can help the police, law enforcement agencies, and insurance companies to reconstruct the events leading up to a collision. Insurance companies require the forensic analysis of accident videos, which is a time-consuming process and involves a large amount of storage. Due to hardware limitations and associated costs, the current standalone (and often dedicated) computing infrastructures used for this purpose are quite limited. Previous research focused on simple video analysis tasks within cloud computing and blockchain technology. The requirements for a large-scale auto-insurance system are quite high and need more thorough investigation. In this paper, a review of the contribution of recent approaches to storing accidental data in cloud computing using blockchain is provided. We focused on the latest cloud and blockchain studies related to auto-insurance along with the related issues and challenges. Some useful solutions and recommendations are provided to address the identified issues and challenges in the cloud-based and blockchain-based auto-insurance sector.

13 February 2023 in IEEE Access
Verified
Journal Article
Open access
NKNarayan Khatri
Narayan Khatri
Sihyung LeeSihyung Lee
Sihyung Lee
AMAbdul Mateen
Abdul Mateen
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
The trustworthiness of nodes in Vehicular Ad-Hoc Networks (VANETs) is essential for disseminating truthful event messages. False messages may cause vehicles to behave in unintended ways, creating an unreliable transportation system. The efficiency and reliability of the transportation system can be obtained through trustworthy vehicular nodes providing correct event messages. In a VANET, the consensus issue can be resolved by employing blockchain. Even if we employ blockchain in a VANET, the trustworthiness of each message recorded needs to be verified separately since the blockchain itself does not guarantee the trust level of each event message. For instance, when there are multiple conflicting messages associated with a single accident on the road, a vote based on majority opinion can be considered one option for making a decision regarding the accident. In this work, we design the VANET event message clustering algorithm (VEMCA) to resolve the conflicting message problem. Furthermore, we develop a simulator for the VANET environment that demonstrates how the clustering algorithm can be used for event message validation. Experimental results show that our algorithm outperforms state-of-the-art clustering algorithms in terms of accuracy, precision, recall, f1-score, and computational time.

20 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
Narayan KhatriNarayan Khatri
Narayan Khatri
Sihyung LeeSihyung Lee
Sihyung Lee
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
In this paper, we propose a Proof-of-Location (PoL)-based location verification scheme for mitigating Sybil attacks in vehicular ad hoc networks (VANETs). For this purpose, we employ smart contracts for storing the location information of the vehicles. This smart contract is maintained by Road Side Units (RSUs) and acts as a ground truth for verifying the position information of the neighboring vehicles. To avoid the storage of fake location information inside the smart contract, vehicles need to solve unique computational puzzles generated by the neighboring RSUs in a limited time frame whenever they need to report their location information. Assuming a vehicle has a single Central Processing Unit (CPU) and parallel processing is not allowed, it can solve a single computational puzzle in a given time period. With this approach, the vehicles with multiple fake identities are prevented from solving multiple puzzles at a time. In this way, we can mitigate a Sybil attack and avoid the storage of fake location information in a smart contract table. Furthermore, the RSUs maintain a dedicated blockchain for storing the location information of neighboring vehicles. They take part in mining for the purpose of storing the smart contract table in the blockchain. This scheme guarantees the privacy of the vehicles, which is achieved with the help of a PoL privacy preservation mechanism. The verifier can verify the locations of the vehicles without revealing their privacy. Experimental results show that the proposed mechanism is effective in mitigating Sybil attacks in VANET. According to the experiment results, our proposed scheme provides a lower fake location registration probability, i.e., lower than 10%, compared to other existing approaches.

6 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
Sihyung LeeSihyung Lee
Sihyung Lee
Seung Yeob NamSeung Yeob Nam
Seung Yeob Nam
Grover’s algorithm leverages quantum computing to efficiently locate solutions in unstructured search spaces, outperforming classical approaches. Since Grover’s algorithm requires prior knowledge of the number of solutions (M) within a search space of size N, previous studies assume M is estimated beforehand and focus on identifying all solutions. Here, we propose a two-step process that integrates both the estimation of M and the discovery of the solutions, optimizing the interactions between the two steps. To enhance efficiency, the estimation step captures as many solutions as possible, leaving the discovery step to focus on the remaining ones. To ensure accuracy, the discovery step continues searching until the probability of finding additional solutions becomes sufficiently low. We implemented and evaluated our methods, showing that over 80% of solutions were found during the estimation phase, allowing the discovery phase to conclude earlier, while identifying over 99% of solutions on average. In theory, the process requires NM × log(M) Grover’s iterations in the worst case, but in practice, it typically terminates after iterations proportional to N. We expect that our methods will be applicable to various search problems and inspire further research on efficiently finding all solutions.