Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hailun Tan

dblp:88/3365 · DBLP profile ↗
← Back
13ranked-venue papers
10as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 5 first-authorComputer networks · 4 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Network security · 39% Hardware security and side channels · 17% Cryptographic protocols and secure computation · 15%
Computer networks
3 papers
Physical-layer communications · 53% Internet of things and sensor networks · 47%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
physical layer security
0.212015
MIO: Enhancing Wireless Communications Security Through Physical Layer Multiple Inter-Symbol Obfuscation · IEEE Trans. Inf. Forensics Secur. 2015
Network security › attack strategy
eavesdropping
0.212015
MIO: Enhancing Wireless Communications Security Through Physical Layer Multiple Inter-Symbol Obfuscation · IEEE Trans. Inf. Forensics Secur. 2015
Internet of things and sensor networks › wireless sensor network
sensor network programming
0.112011
Secure Multihop Network Programming with Multiple One-Way Key Chains · IEEE Trans. Mob. Comput. 2011
Cryptographic primitives and cryptanalysis
hash chains
0.112011
Secure Multihop Network Programming with Multiple One-Way Key Chains · IEEE Trans. Mob. Comput. 2011
Cryptographic protocols and secure computation
key management
0.112011
Secure Multihop Network Programming with Multiple One-Way Key Chains · IEEE Trans. Mob. Comput. 2011
Hardware security and side channels › trusted execution environments
remote attestation
0.112010
A hardware-based remote attestation protocol in wireless sensor networks · IPSN 2010
Cyber-physical and IoT security
wireless sensor network security
0.112010
A hardware-based remote attestation protocol in wireless sensor networks · IPSN 2010
Network security › attack strategy › traffic manipulation
fake packet injection
0.112015
MIO: Enhancing Wireless Communications Security Through Physical Layer Multiple Inter-Symbol Obfuscation · IEEE Trans. Inf. Forensics Secur. 2015
Internet of things and sensor networks
wireless sensor network
0.012010
A hardware-based remote attestation protocol in wireless sensor networks · IPSN 2010
Internet of things and sensor networks › wireless sensor network
wireless sensor nodes
0.012010
A hardware-based remote attestation protocol in wireless sensor networks · IPSN 2010
Hardware security and side channels › trusted execution environments
trusted platform module
0.012010
A hardware-based remote attestation protocol in wireless sensor networks · IPSN 2010

Methods — techniques the papers use, named apart from their topics

inter-symbol obfuscation · 0.4artificial noise · 0.4one-way hash chain · 0.2
YearPublicationVenuePosition
2025 SSMO-Frame: A small-sample multi-objective integrated optimization framework for vehicle body structure
Zhicheng He 0004, Shaowei Chen, Aiguo Cheng, Jisi Chen, Hailun Tan
Adv. Eng. Informatics7
2019 MTRA: Multi-Tier randomized remote attestation in IoT networks
Hailun Tan, Gene Tsudik, Sanjay K. Jha
Comput. Secur.1
2015 A remote attestation protocol with Trusted Platform Modules (TPMs) in wireless sensor networks
abstract
Given the limited resources and computational power of current embedded sensor devices, memory protection is difficult to achieve and generally unavailable. Hence, the software run-time buffer overflow that is used by the worm attacks in the Internet could be easily exploited to inject malicious codes into wireless sensor networks (WSNs). As a result, the remote attestation on the application codes installed in WSNs is the first important step to detect any unauthorized changes through the buffer overflow attack. Previous software-based remote code verification approaches such as SoftWare-based ATTestation and Secure Code Update By Attestation have been shown difficult to deploy in recent work. In this paper, we propose and implement a remote attestation protocol for detecting unauthorized tampering in the application codes running on sensor nodes with the assistance of Trusted Platform Modules (TPMs), a tiny, cost-effective and tamper-proof cryptographic micro-controller. In our design, each sensor node is equipped with a TPM, and the firmware running on the node could be verified by the other sensor nodes in a WSN, including the sink. Specifically, we present a hardware-based remote attestation protocol, discuss the potential attacks an adversary could launch against the protocol and provide comprehensive system performance results of the protocol in a multi-hop sensor network testbed. The experimental results demonstrated that our scheme is able to attest the application codes running in sensor node with small delay (less than 25 s for single-hop), considerable network lifetime and reasonable communication and energy overhead. Copyright © 2015 John Wiley & Sons, Ltd.
Hailun Tan, Wen Hu 0001, Sanjay K. Jha
Secur. Commun. Networks1
2015 MIO: Enhancing Wireless Communications Security Through Physical Layer Multiple Inter-Symbol Obfuscation
abstract
Communications security is a critical and increasingly challenging issue in wireless networks. A well-known approach for achieving information-theoretic secrecy relies on deploying artificial noises to blind the intruders' interception in the physical layer. However, this approach requires a static channel condition for the transmitter and receiver to generate and offset the controllable artificial noise, which can hardly be implemented in real wireless environments. In this paper, we explore the feasibility of symbol obfuscation to defend against the passive eavesdropping attack and fake packet injection attack during the wireless communications. We propose a multiple inter-symbol obfuscation (MIO) scheme, which utilizes a set of artificial noisy symbols (symbols key) to obfuscate the original data symbols in the physical layer. MIO can effectively enhance the wireless communications security. On the one hand, an eavesdropper, without knowing the artificial noisy symbols, cannot correctly decrypt the obfuscated symbols from the eavesdropped packets. On the other hand, a legitimate receiver can easily check the integrity of the symbols key and then reject the fake packets from the received packets. The security analysis reveals that, without considering the initial key, the MIO scheme can achieve information-theoretic secrecy against the passive eavesdropping attack and computational secrecy against the fake packet injection attack. Moreover, we have implemented our approach in a USRP2 testbed and conducted simulations with Simulink tools to validate the effectiveness of MIO in enhancing wireless communications security.
Wei Lou, Jie Zhang 0076, Hailun Tan
IEEE Trans. Inf. Forensics Secur.4
2013 A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks
Hailun Tan, Diethelm Ostry, John Zic, Sanjay K. Jha
Comput. Secur.1
2011 FLIMS: A Fuzzy-LogIc Based Mobility Management Scheme in Mobile Ad Hoc Networks
abstract
Mobility management is particularly important and challenging in Mobile Ad-hoc Networks (MANETs) because mobile nodes frequently change their locations, which may aggravate the performance in MANETs severely in many aspects (e.g., multi-hop routing). In this paper, we propose a Fuzzy-LogIc based Mobility management Scheme (FLIMS), to manipulate location messages of mobile nodes in MANETs efficiently. To the best of our knowledge, we are the first to employ the fuzzy logic to manage the location messages in mobility management scheme in MANETs. We provide simulation results that illustrate our scheme performs better than the existing schemes.
Hailun Tan
VTC Fall1
2011 Secure Multihop Network Programming with Multiple One-Way Key Chains
abstract
Current network programming protocols provide an efficient way to update program images running on sensor nodes without having physical access to them. Securing these updates, however, remains a challenging and important issue, given the open environment where sensor nodes are often deployed. Several approaches addressing these issues have been reported, but their use of cryptographically strong protocols means that their computational costs (and hence, power consumption and communication costs) are relatively high. In this paper, we propose a novel scheme to secure a multihop network programming protocol through the use of multiple one-way hash chains. The scheme is shown to be lower in computational, power consumption, and communication costs yet still able to secure multihop propagation of program images. We demonstrate the use of this scheme and provide some results using the popular network programming protocol, Deluge. In addition, we include a performance evaluation of our scheme, implemented in TinyOS, in terms of latency and energy consumption.
Hailun Tan, John Zic, Sanjay K. Jha, Diethelm Ostry
IEEE Trans. Mob. Comput.1
2010 A hardware-based remote attestation protocol in wireless sensor networks
abstract
Given the limited resources and computational power of current embedded sensor devices memory protection is difficult to achieve and generally unavailable. Hence, the buffer overflow that is used by the worm attacks in the Internet can be easily exploited to inject malicious code into Wireless Sensor Networks (WSNs). We designed a hardware-based remote attestation protocol to counter the buffer overflow attack. In our attestation protocol, each sensor node is equipped with a Trusted Platform Module (TPM) board. The TPM is responsible for content verification of the program flash. To the best of our knowledge, it is the first remote attestation protocol in WSNs with each sensor node equipped with TPM.
Hailun Tan, Wen Hu 0001, Sanjay K. Jha
IPSN1
2010 Toward trusted wireless sensor networks
abstract
This article presents the design and implementation of a trusted sensor node that provides Internet-grade security at low system cost. We describe trustedFleck, which uses a commodity Trusted Platform Module (TPM) chip to extend the capabilities of a standard wireless sensor node to provide security services such as message integrity, confidentiality, authenticity , and system integrity based on RSA public-key and XTEA-based symmetric-key cryptography. In addition trustedFleck provides secure storage of private keys and provides platform configuration registers (PCRs) to store system configurations and detect code tampering. We analyze system performance using metrics that are important for WSN applications such as computation time, memory size, energy consumption and cost. Our results show that trustedFleck significantly outperforms previous approaches (e.g., TinyECC) in terms of these metrics while providing stronger security levels. Finally, we describe a number of examples, built on trustedFleck, of symmetric key management, secure RPC, secure software update, and remote attestation .
Wen Hu 0001, Hailun Tan, Peter I. Corke, Wen Chan Shih, Sanjay K. Jha
ACM Trans. Sens. Networks2
2009 A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks
abstract
Code dissemination protocols provide a convenient way to update program images via wireless communication. Due to the open environment in which Wireless Sensor Networks (WSNs) are typically deployed, it is important that a code dissemination protocol ensures that a program image update can be authenticated as coming from a trusted source. In some applications it is also required that the data be kept confidential in spite of the possibility of message interception. Authentication and confidentiality are implemented through cryptographic operations which may be expensive in power consumption, making a protocol with these features vulnerable to attack by an adversary who transmits forged data, forcing nodes to waste energy in identifying it as invalid i.e., a signature-based DoS attack). Additionally, in multi-hop dissemination protocols, each sensor node is required to broadcast its program image when requested by its neighbors. An adversary could repeatedly send spurious program image requests to its neighbors, making them exhaust their energy reserves i.e., request-based DoS attack). In this paper, we present a new approach to achieve confidentiality in multi-hop code dissemination. We propose counter-measures against both types of DoS attacks mentioned above. To our knowledge, we are the first to integrate confidentiality and DoS-attack-resistance in a multi-hop code dissemination protocol. Our approach is based on Deluge, an open source, state-of-the-art code dissemination protocol for WSNs. In addition, We provide a performance evaluation in terms of latency and energy consumption in our scheme, compared with the original Deluge and the existing secure Deluge.
Hailun Tan, Diethelm Ostry, John Zic, Sanjay K. Jha
WISEC1
2008 Secure multi-hop network programming with multiple one-way key chains
abstract
Current network programming protocols provide an efficient way to update the program image running on sensor nodes without physical access to them. However, given the open environment in which sensor nodes are deployed, securing network programming is a challenging task. Existing work addressing this issue either lack consideration of securing multi-hop network programming protocols, or are not cost-efficient. To our knowledge, none of them have evaluated the power consumption. In this paper, we propose a novel scheme to secure multi-hop network programming protocols using multiple one-way hash chains. This scheme is resilient to malicious program image injection by the compromised nodes and it secures multi-hop propagation of program images for sensor nodes. Based on the most popular network programming protocol, Deluge, an overhead analysis on this schemes is given. In addition, our scheme is implemented in TinyOS and a performance evaluation in terms of latency and energy consumption is presented.
Hailun Tan, Sanjay K. Jha, Diethelm Ostry, John Zic, Vijay Sivaraman
WISEC1
2007 On Mitigating Malicious Behavior Against Routing in Wireless Network
abstract
Network routing is a cooperative process. The network performance will be seriously degraded if one or more network components are compromised to network attackers and they behave maliciously. There have been a few literatures to address the robustness of network routing but few of them have holistic countermeasure against them (especially combined misbehavior). In this paper, we propose a novel network protocol to address these imperative issues that have been ignored in existing literature. We present the scalability evaluation of our network protocol through the simulation in NS2. We derive the complete analytical model behind our design. The respective simulation result from NS2 also proves the correctness of the analytical model. The simulation results on the network performance improvement compared to other solutions are also presented.
Hailun Tan
WCNC1
2006 Maximizing network lifetime in energy-constrained wireless sensor network
abstract
In the research field of Wireless Sensor Networks (WSN), how to reduce the energy consumption of WSN so that the lifetime of WSN can be prolonged is one of the hottest spots. In this paper, the introduction on the relevant research is given firstly. The hexagon-grid algorithm is proposed to schedule the sensor nodes activities in WSN and the respective analysis is carried out after that. At last, simulation result for the proposed algorithm is presented and the conclusion of this new algorithm is given.
Hailun Tan
IWCMC1