Mun Choon Chan

Mun Choon Chan

Auto-generated profile, based on publicly available information

Mun Choon Chan

National University of Singapore, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
10 September 2023
Verified
Conference Paper
Open access
CSCha Hwan Song
Cha Hwan Song
XKXin Zhe Khooi
Xin Zhe Khooi
RJRaj Joshi
Raj Joshi
ICInho Choi
Inho Choi
JLJialin Li
Jialin Li
MCMun Choon Chan
Mun Choon Chan

14 January 2024 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
LCLevente Csikor
Levente Csikor
HLHoon Wei Lim
Hoon Wei Lim
JWJun Wen Wong
Jun Wen Wong
SRSoundarya Ramesh
Soundarya Ramesh
RPRohini Poolat Parameswarath
Rohini Poolat Parameswarath
MCMun Choon Chan
Mun Choon Chan
Automotive Keyless Entry (RKE) systems provide car owners with a degree of convenience, allowing them to lock and unlock their car without using a mechanical key. Today’s RKE systems implement disposable rolling codes, making every key fob button press unique, effectively preventing simple replay attacks. However, a prior attack called RollJam was proven to break all rolling code–based systems in general. By a careful sequence of signal jamming, capturing, and replaying, an attacker can become aware of the subsequent valid unlock signal that has not been used yet. RollJam, however, requires continuous deployment indefinitely until it is exploited. Otherwise, the captured signals become invalid if the key fob is used again without RollJam in place. We introduce RollBack, a new replay-and-resynchronize attack against most of today’s RKE systems. In particular, we show that even though the one-time code becomes invalid in rolling code systems, replaying a few previously captured signals consecutively can trigger a rollback-like mechanism in the RKE system. Put differently, the rolling codes become resynchronized back to a previous code used in the past from where all subsequent yet already used signals work again. Moreover, the victim can still use the key fob without noticing any difference before and after the attack. Unlike RollJam, RollBack does not necessitate jamming at all. In fact, it requires signal capturing only once and can be exploited at any time in the future as many times as desired. This time-agnostic property is particularly attractive to attackers, especially in car-sharing/renting scenarios in which accessing the key fob is straightforward. However, while RollJam defeats virtually any rolling code–based system, vehicles might have additional anti-theft measures against malfunctioning key fobs, hence against RollBack. Our ongoing analysis (with crowd-sourced data) against different vehicle makes and models has revealed that ∼ 50% of the examined vehicles in the Asian region are vulnerable to RollBack, whereas the impact tends to be smaller in other regions, such as Europe and North America.

17 July 2023 in IEEE Systems Journal
Verified
Journal Article
Closed access
JDJagnyashini Debadarshini
Jagnyashini Debadarshini
MTMadhav Tummala
Madhav Tummala
SSSudipta Saha
Sudipta Saha
OLOlaf Landsiedel
Olaf Landsiedel
MCMun Choon Chan
Mun Choon Chan
Many-to-many/all-to-all sharing of data is one of the common requirements in any distributed/decentralized system. In low-power wireless distributed systems composed of highly resource-constrained devices, a many-to-many data-sharing strategy needs to be not only efficient but also sufficiently simple in nature. Advancements in the field of synchronous transmission (ST) have proliferated a number of efficient data-sharing strategies for low-power systems. In this work, we first identify the fundamental and simple possible approaches to accomplish the goal. Through extensive simulation-based comparison among them, we demonstrate the superiority of the approach adopted by a strategy called MiniCast where the desired task is achieved through pipelined execution of the one-to-many floods from the designated source nodes. However, through further in-depth study, we identify certain crucial flaws in MiniCast, which are mostly caused by its substandard realization through radio-event-triggered architecture. To circumvent the problems, we propose a new strategy TimeCast where the radio-event-triggered architecture of MiniCast is replaced by a time-triggered architecture. Through rigorous experimental studies in IoT-testbeds, we demonstrate that TimeCast substantially improves the robustness, and thus, due to lesser failures, it achieves all-to-all data-sharing up to 57.1% faster while consuming up to 63.6% lesser radio- on time compared to MiniCast.

10 September 2023
Verified
Conference Paper
Open access
RJRaj Joshi
Raj Joshi
CSCha Hwan Song
Cha Hwan Song
XKXin Zhe Khooi
Xin Zhe Khooi
NBNishant Budhdev
Nishant Budhdev
AMAyush Mishra
Ayush Mishra
BLBen Leong
Ben Leong

1 January 2010
Verified
Conference Paper
Open access
FCFai Cheong Choo
Fai Cheong Choo
MCMun Choon Chan
Mun Choon Chan
ECEe-Chien Chang
Ee-Chien Chang
In this work, we study robustness of DTN routing in the absence of authentication. We identify conditions for an attack to be effective and present an attack based on a combination of targeted flooding and acknowledgement counterfeiting that is highly effective even with only a small number of attackers. Simulation results show that delivery ratio decrease by 30% to 50% using only 2 attackers for the two mobility patterns studied (Haggle and DieselNet). We observe that minimum hop count for packet delivery has a strong influence on the robustness of the DTN routing protocols. Generally, attacks become increasingly effective when the minimum hop count required increases. Further, use of global routing metadata in the routing protocol also increases attack effectiveness. Our study provides insights to the robustness of routing attacks in different DTNs settings and can be useful to DTN designers who want to choose the appropriate level of security that is needed for their respective scenarios.

6 May 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Xingyu FengXingyu Feng
Xingyu Feng
Chengwen LuoChengwen Luo
Chengwen Luo
Bo WeiBo Wei
Bo Wei
JZJin Zhang
Jin Zhang
JLJianqiang Li
Jianqiang Li
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung
Recently we have witnessed the rise of Artificial Intelligence of Things (AIoT) and the shift of sensing paradigm from cloud-centric to the edge-centric, which effectively improves the sensing capability of intelligence transportation systems. To improve the real-time sensing performance, in this work we propose an ensemble sensing based scheme to solve the time-constraint synchronized inference problem and achieve robust inference with heterogeneous IoT devices in intelligence transportation systems. We design and implement Ensen, which incorporates various novel techniques such as customized DNN model design, KD-based model training, and dynamic deep ensemble management, etc., to achieve improved accuracy and maximize the computational resource usage of the whole sensing group. Extensive evaluations on different types of common IoT devices have shown that Ensen achieves a robust performance and can be easily extended to different types of convolutional neural networks.