Manpyo Hong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Manpyo Hong has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Usman Tariq
American University of Sharjah, Sharjah, United Arab Emirates
3 shared publications - Cheongmin Ji
Department of Computer Engineering, Ajou University, Suwon 16499, Republic of Korea
2 shared publications - Hongjin Yeh
Graduate School of Information and Communications, Ajou University, Suwon, Korea
2 shared publications - Irfan Ahmed
Virginia Commonwealth University
2 shared publications - Jai-Hoon Kim
Department of Cyber Security, Ajou University, Suwon, South Korea
2 shared publications - Kangseok Kim
Department of Cyber Security, College of Computing and Informatics in Ajou University, Suwon 16499, Republic of Korea
2 shared publications
Latest Publications
- Open Access
- 1 December 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-9
AVoD: Advanced Verify-on-Demand for Efficient Authentication against DoS Attacks in V2X Communication
Owing to the development of information and communication technology (ICT), autonomous cooperative vehicles are being developed. Autonomous cooperative driving combines vehicle-to-everything (V2X) communication technology in existing autonomous driving and provides safe driving by sharing information between communication entities. However, security factors should be considered during communication. Security Credential Management System (SCMS) has been proposed as one of these elements, but it is vulnerable to denial-of-service (DoS) attacks due to message authentication costs. In congested situations, the number of messages exchanged between vehicles becomes very large. However, the performance of the on-board unit (OBU) is not sufficient to handle huge number of messages, which can lead to a DoS attack. Therefore, a technique to prevent DoS attacks on autonomous cooperative driving vehicles using SCMS has been proposed in this paper. The proposed technique reduces authentication costs by classifying similar messages into multiple categories and authenticating only the first message represented in the group for a unit time. The effectiveness of this technique has been demonstrated by comparing the time it takes to verify huge number of message signatures in each method.
- 1 December 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-9
Open AccessAVoD: Advanced Verify-on-Demand for Efficient Authentication against DoS Attacks in V2X Communication
Owing to the development of information and communication technology (ICT), autonomous cooperative vehicles are being developed. Autonomous cooperative driving combines vehicle-to-everything (V2X) communication technology in existing autonomous driving and provides safe driving by sharing information between communication entities. However, security factors should be considered during communication. Security Credential Management System (SCMS) has been proposed as one of these elements, but it is vulnerable to denial-of-service (DoS) attacks due to message authentication costs. In congested situations, the number of messages exchanged between vehicles becomes very large. However, the performance of the on-board unit (OBU) is not sufficient to handle huge number of messages, which can lead to a DoS attack. Therefore, a technique to prevent DoS attacks on autonomous cooperative driving vehicles using SCMS has been proposed in this paper. The proposed technique reduces authentication costs by classifying similar messages into multiple categories and authenticating only the first message represented in the group for a unit time. The effectiveness of this technique has been demonstrated by comparing the time it takes to verify huge number of message signatures in each method.
- Open Access
- 8 October 2021
- Published by MDPI AG in Electronics
- Vol. 10 (19) , 2442
CA-CRE: Classification Algorithm-Based Controller Area Network Payload Format Reverse-Engineering Method
In vehicles, dozens of electronic control units are connected to one or more controller area network (CAN) buses to exchange information and send commands related to the physical system of the vehicles. Furthermore, modern vehicles are connected to the Internet via telematics control units (TCUs). This leads to an attack vector in which attackers can control vehicles remotely once they gain access to in-vehicle networks (IVNs) and can discover the formats of important messages. Although the format information is kept secret by car manufacturers, CAN is vulnerable, since payloads are transmitted in plain text. In contrast, the secrecy of message formats inhibits IVN security research by third-party researchers. It also hinders effective security tests for in-vehicle networks as performed by evaluation authorities. To mitigate this problem, a method of reverse-engineering CAN payload formats is proposed. The method utilizes classification algorithms to predict signal boundaries from CAN payloads. Several features were uniquely chosen and devised to quantify the type-specific characteristics of signals. The method is evaluated on real-world and synthetic CAN traces, and the results show that our method can predict at least 10% more signal boundaries than the existing methods.
- 8 October 2021
- Published by MDPI AG in Electronics
- Vol. 10 (19) , 2442
Open AccessCA-CRE: Classification Algorithm-Based Controller Area Network Payload Format Reverse-Engineering Method
In vehicles, dozens of electronic control units are connected to one or more controller area network (CAN) buses to exchange information and send commands related to the physical system of the vehicles. Furthermore, modern vehicles are connected to the Internet via telematics control units (TCUs). This leads to an attack vector in which attackers can control vehicles remotely once they gain access to in-vehicle networks (IVNs) and can discover the formats of important messages. Although the format information is kept secret by car manufacturers, CAN is vulnerable, since payloads are transmitted in plain text. In contrast, the secrecy of message formats inhibits IVN security research by third-party researchers. It also hinders effective security tests for in-vehicle networks as performed by evaluation authorities. To mitigate this problem, a method of reverse-engineering CAN payload formats is proposed. The method utilizes classification algorithms to predict signal boundaries from CAN payloads. Several features were uniquely chosen and devised to quantify the type-specific characteristics of signals. The method is evaluated on real-world and synthetic CAN traces, and the results show that our method can predict at least 10% more signal boundaries than the existing methods.
- Open Access
- 21 August 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-10
Secure Collaborative Key Management for Dynamic Groups in Mobile Networks
Mobile networks are composed of heterogeneous mobile devices with peer-to-peer wireless communication. Their dynamic and self-organizing natures pose security challenge. We consider secure group key management for peer dynamic groups in mobile wireless networks. Many group based applications have achieved remarkable growth along with increasing use of multicast based services. The key sharing among the group members is an important issue for secure group communication because the communication for many participants implies that the likelihood of illegal overhearing increases. We propose a group key sharing scheme and efficient rekeying methods for frequent membership changes from network dynamics. The proposed method enables the group members to simply establish a group key and provide high flexibility for dynamic group changes such as member join or leave and group merging or partition. We conduct mathematical evaluation with other group key management protocols and finally prove its security by demonstrating group key secrecy, backward and forward secrecy, key independence, and implicit key authentication under the decisional Diffie-Hellman (DDH) assumption.
- 21 August 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-10
Open AccessSecure Collaborative Key Management for Dynamic Groups in Mobile Networks
Mobile networks are composed of heterogeneous mobile devices with peer-to-peer wireless communication. Their dynamic and self-organizing natures pose security challenge. We consider secure group key management for peer dynamic groups in mobile wireless networks. Many group based applications have achieved remarkable growth along with increasing use of multicast based services. The key sharing among the group members is an important issue for secure group communication because the communication for many participants implies that the likelihood of illegal overhearing increases. We propose a group key sharing scheme and efficient rekeying methods for frequent membership changes from network dynamics. The proposed method enables the group members to simply establish a group key and provide high flexibility for dynamic group changes such as member join or leave and group merging or partition. We conduct mathematical evaluation with other group key management protocols and finally prove its security by demonstrating group key secrecy, backward and forward secrecy, key independence, and implicit key authentication under the decisional Diffie-Hellman (DDH) assumption.
- 23 April 2013
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (5) , 1557-1576
An interactive pervasive whiteboard based on MVC architecture for ubiquitous collaboration
- 23 April 2013
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (5) , 1557-1576
An interactive pervasive whiteboard based on MVC architecture for ubiquitous collaboration
- 5 June 2012
- Published by Springer Nature
- p. 203-212
Extended OTP Mechanism Based on Graphical Password Method
- 5 June 2012
- Published by Springer Nature
- p. 203-212
Extended OTP Mechanism Based on Graphical Password Method
- 17 April 2012
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 17 (5) , 933-943
Go anywhere: user-verifiable authentication over distance-free channel for mobile devices
- 17 April 2012
- Published by Springer Nature in Personal and Ubiquitous Computing
- Vol. 17 (5) , 933-943
Go anywhere: user-verifiable authentication over distance-free channel for mobile devices
- Open Access
NACS: non-overlapping AP's caching scheme to reduce handoff in 802.11 wireless LAN
With the escalation of the IEEE 802.11 based wireless networks, voice over IP and analogous applications are also used over wireless networks. Recently, the wireless LAN systems are spaciously deployed for public Internet services. In public wireless LAN systems, reliable user authentication and mobility support are indispensable issues. When a mobile device budges out the range of one access point (AP) and endeavor to connect to new AP, it performs handoff. Contemporarily, PNC and SNC were proposed to propagate the MN context to the entire neighboring AP's on the wireless network with the help of neighbor graph. In this paper, we proposed a non-overlapping AP's caching scheme (NACS), which propagates the mobile node context to those AP's which do not overlap with the current AP. To capture the topology of non-overlapping AP's in the wireless network, non-overlapping graph (NOG) is generated at each AP. Simulation results shows that NACS reduces the signaling cost of propagating the MN context to the neighbor AP's in the wireless network.
Open AccessNACS: non-overlapping AP's caching scheme to reduce handoff in 802.11 wireless LAN
With the escalation of the IEEE 802.11 based wireless networks, voice over IP and analogous applications are also used over wireless networks. Recently, the wireless LAN systems are spaciously deployed for public Internet services. In public wireless LAN systems, reliable user authentication and mobility support are indispensable issues. When a mobile device budges out the range of one access point (AP) and endeavor to connect to new AP, it performs handoff. Contemporarily, PNC and SNC were proposed to propagate the MN context to the entire neighboring AP's on the wireless network with the help of neighbor graph. In this paper, we proposed a non-overlapping AP's caching scheme (NACS), which propagates the mobile node context to those AP's which do not overlap with the current AP. To capture the topology of non-overlapping AP's in the wireless network, non-overlapping graph (NOG) is generated at each AP. Simulation results shows that NACS reduces the signaling cost of propagating the MN context to the neighbor AP's in the wireless network.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-114
Binding Update Authentication Scheme for Mobile IPv6
Mobile IPv6 provides route optimization mechanism for fast communication by lessening the overhead of indirection. Although it ameliorates the communication latency but it also needs good authentication mechanism to make route optimization more effective and reliable. In this paper, we improve one of the route optimization security mechanisms called bombing resistant protocol, and propose a new binding update authentication scheme. Both mechanisms perform the care of address validation of the mobile node and maintain the integrity of the binding update message during binding update process, while the latter performs better in terms of latency and computation. They also resolve reflection and amplification, intensive computation problem.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-114
Binding Update Authentication Scheme for Mobile IPv6
Mobile IPv6 provides route optimization mechanism for fast communication by lessening the overhead of indirection. Although it ameliorates the communication latency but it also needs good authentication mechanism to make route optimization more effective and reliable. In this paper, we improve one of the route optimization security mechanisms called bombing resistant protocol, and propose a new binding update authentication scheme. Both mechanisms perform the care of address validation of the mobile node and maintain the integrity of the binding update message during binding update process, while the latter performs better in terms of latency and computation. They also resolve reflection and amplification, intensive computation problem.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-114
Binding Update Authentication Scheme for Mobile IPv6
Mobile IPv6 provides route optimization mechanism for fast communication by lessening the overhead of indirection. Although it ameliorates the communication latency but it also needs good authentication mechanism to make route optimization more effective and reliable. In this paper, we improve one of the route optimization security mechanisms called bombing resistant protocol, and propose a new binding update authentication scheme. Both mechanisms perform the care of address validation of the mobile node and maintain the integrity of the binding update message during binding update process, while the latter performs better in terms of latency and computation. They also resolve reflection and amplification, intensive computation problem.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-114
Binding Update Authentication Scheme for Mobile IPv6
Mobile IPv6 provides route optimization mechanism for fast communication by lessening the overhead of indirection. Although it ameliorates the communication latency but it also needs good authentication mechanism to make route optimization more effective and reliable. In this paper, we improve one of the route optimization security mechanisms called bombing resistant protocol, and propose a new binding update authentication scheme. Both mechanisms perform the care of address validation of the mobile node and maintain the integrity of the binding update message during binding update process, while the latter performs better in terms of latency and computation. They also resolve reflection and amplification, intensive computation problem.
- 1 December 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Quick Fix, an expeditious approach to diminish SPAM
In recent times e-mail is proved to be an eradicator application on Internet. Spam has traditionally been most visible threat and fashioning the major problem in the e-commerce society. Survey reports showed that the 60% of all mail messages are spam. Identifying and removal of spam from the email delivery systems allows end users to regain a useful means of communication. Spam filters offer a way to curb the problem. In this paper, we present learning based personalized anti spam filter. We discuss the architecture and present a comparative study of the proposed anti spam filtering technique. We use public and private email corpora from wide community of Internet users collected over several months for comparative study. Simulation results show that appropriate training of a personalized filter gives more adequate results than the schemas previously proposed
- 1 December 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Quick Fix, an expeditious approach to diminish SPAM
In recent times e-mail is proved to be an eradicator application on Internet. Spam has traditionally been most visible threat and fashioning the major problem in the e-commerce society. Survey reports showed that the 60% of all mail messages are spam. Identifying and removal of spam from the email delivery systems allows end users to regain a useful means of communication. Spam filters offer a way to curb the problem. In this paper, we present learning based personalized anti spam filter. We discuss the architecture and present a comparative study of the proposed anti spam filtering technique. We use public and private email corpora from wide community of Internet users collected over several months for comparative study. Simulation results show that appropriate training of a personalized filter gives more adequate results than the schemas previously proposed