Browsing by Author "Shieh, Shiuhpyng"

Now showing 1 - 14 of 14

A path authentication scheme for routing disruption attack prevention in ad hoc network
(2006)
Li-Joe Lin
;
Shieh, Shiuhpyng
;
Yang, Tzu-I
;
Lin, Warren W.
;
資訊工程學系
Ad hoc routing protocols are vulnerable due to the absence of security mechanisms, allowing attacks such as forged routing advertisements to disrupt the routing scheme. Research work has been proposed for securing the routing protocol in ad hoc networks; however, solutions that utilize asymmetric cryptographic primitives are often infeasible in a constrained mobile environment. In this paper, we discover a strict, cooperative disruption attack on the route path and identify the deficiency of present security mechanisms for protecting routing information. We then propose a path authentication scheme which relies on efficient symmetric cryptographic primitives. The Random Assignment Path Authentication (RAPA) scheme guarantees the integrity of a complete request route path in the route discovery procedure and helps the current on-demand routing protocol in resisting routing disruption attacks.
Can Malware Be Exterminated by Better Understanding Its Roots?
(2014-11-01)
Cho, Michael Cheng Yi
;
Hsu, Chia-Wei
;
Shieh, Shiuhpyng
;
Wang, Chi-Wei
;
資訊工程學系
DROIT plus : Taint Tracking for Storage Access on Android
(2017-09-01)
Hsu, Chia-Wei
;
Chang, Chia-Huei
;
Wang, Chi-Wei
;
Shieh, Shiuhpyng
;
資訊工程學系
The leakage of sensitive data has been a major concern in Android ecosystem. Analysts therefore propose dynamical taint tracking to effectively track the data flow of accessed data. However, the off-the-shelf taint tracking systems lack byte-granularity support for storage tracking. In this paper, we propose DROIT+ which uses the fine-grained storage tracking technique to track data flow among Android storages. DROIT+ is able to reveal the composition of data flows. Storage tracking on Android is difficult since data flows of apps may span heterogeneous media including memory, SD cards, NAND Flash, and network adapters. To capture a whole picture of data flows in storage, we formally define data flow and propose our method from both logical and physical perspectives. The method has also been implemented as an extension to the proposed tracking system, DROIT. Two case studies and two benchmark tools are used for the evaluation in terms of storage tracking ability, network tracking ability, and efficiency, respectively. The result shows that DROIT+ provides a better coverage using byte-granularity taint tracking.
Finder: Automatic ICC Data Reconstruction for Long-Term Runtime Semantics
(2018-01-01)
Hsu, Chia-Wei
;
Wei, Sheng-Ru
;
Shieh, Shiuhpyng
;
資訊工程學系
;
Department of Computer Science
In Android, both system services and apps are composed of components, and the inter-component communication (ICC) is therefore vital for representing the system states of the past runtime. Conventional approaches focus on inspecting the program behaviors of apps in the laboratory environment, but not suitable for a long-time period, system-wide activities. Analysts consider that ICC preserves much runtime semantics, so we propose Finder, an automatic ICC data reconstruction system to provide a long-term and comprehensive view of the past runtime. We decouple the program analysis on ICC from runtime monitoring thereby decreasing the runtime overhead. Finder applies transpiling techniques to generate the data resolvers compatible with all off-the-shelf Android version. The generated data resolvers can reconstruct a high-level, system-wide runtime information, and therefore the result is useful for digital forensic, program analysis, and auditing.
IoT Security: Ongoing Challenges and Research Opportunities
(2014-01-01)
Zhang, Zhi-Kai
;
Cho, Michael Cheng Yi
;
Wang, Chia-Wei
;
Hsu, Chia-Wei
;
Chen, Chong-Kuan
The Internet of Things (IoT) opens opportunities for wearable devices, home appliances, and software to share and communicate information on the Internet. Given that the shared data contains a large amount of private information, preserving information security on the shared data is an important issue that cannot be neglected. In this paper, we begin with general information security background of IoT and continue on with information security related challenges that IoT will encountered. Finally, we will also point out research directions that could be the future work for the solutions to the security challenges that IoT encounters.
Penetration Testing in the IoT Age
(2018-04-01)
Chen, Chung-Kuan
;
Zhang, Zhi-Kai
;
Lee, Shan-Hsin
;
Shieh, Shiuhpyng
;
資訊工程學系
Internet of Things (IoT) objects offer new services but also pose new security threats. Due to the heterogeneity, large number, and resource constraints of these objects, new penetration testing tools and techniques are needed to complement defensive mechanisms.
Proactive Distributed Digital Evidence Preservation with Tamper Resistance, Perfect Secrecy and High Survivability
(2014-11-01)
Lin, Jia-Chun
;
Shieh, Shiuhpyng
;
Hsu, Chia-Wei
;
資訊工程學系
;
Department of Computer Science
To reduce the chance of being compromised, digital evidence must be preserved in a secure way when it is generated. The preservation must assure confidentiality, integrity, and survivability of the digital evidence. Some generic storage systems have been proposed. However, they cannot meet the critical requirements for digital evidence preservation. This paper introduces a secure distributed digital evidence preservation system (DEPS) which can preserve digital evidence generated by mission critical servers. With the novel and lightweight (n, n, n-1) secret recovery scheme we proposed, DEPS can efficiently divide each block of a digital evidence file into n shares, compress the first n-1 shares, and then construct a share-message with a sequence number and a fingerprint for each share. Only all the n shares combined together suffice for recovering the block. An adversary can neither obtain any information about the original block from a share-message, nor can he modify digital evidence without being discovered. By using intelligent replication, DEPS can dynamically duplicate and distribute each share-message to a set of distributed repositories to achieve high survivability. The security and performance analyses showed that DEPS is adequate for preserving digital evidence.
ProbeBuilder: Uncovering Opaque Kernel Data Structures for Automatic Probe Construction
(2016-09-10)
Wang, Chi-Wei
;
Wang, Chia-Wei
;
Shieh, Shiuhpyng
;
資訊工程學系
;
Department of Computer Science
VM-based inspection tools generally implement probes in the hypervisor to monitor events and the state of kernel of the guest system. The most important function of a probe is to carve information of interest out of the memory of the guest when it is triggered. Implementing probes for a closed-source OS demands manually reverse-engineering the undocumented code/data structures in the kernel binary image. Furthermore, the reverse-engineering result is often non-reusable between OS versions or even kernel updates due to the rapid change of these structures. In this paper, we propose ProbeBuilder, a system automating the process to inference kernel data structures. Based on dynamic execution, ProbeBuilder searches for data structures matching the "pointer-offset-pointer" pattern in guest memory. The sequences of these offsets, which are referred to as dereferences, are then verified by ProbeBuilder with instruction evidence that traverse them. The experiment on Windows kernel shows that ProbeBuilder efficiently narrows thousands of choices for kernel-level probes down to dozens. The finding allows analysts to quickly implement probes, facilitating rapid development/update of inspection tools for different OSes. With these features, ProbeBuilder is the first system capable of automatically generating practical probes that extracts information through dereferences to opaque kernel data structures.
Provable Secure AKA Scheme with Reliable Key Delegation in UNITS
(2009)
Huang, Yu-Lun
;
Shen, C. Y.
;
Shieh, Shiuhpyng
;
Wang, Hung-Jui
;
Lin, Cheng-Chun
The Authentication Key Agreement Scheme (AKA) of Universal Mobile Telecommunication System (UNITS) provides substantial enhancement to solve the vulnerabilities in GSM and other wireless communication systems. However, we discovered four security weaknesses of UNITS AKA, that is, redirection attack, man-in-the-middle attack, sequence number depletion, and roaming attack. An adversary can launch these attacks to eavesdrop, or cause billing problems. To cope with these problems, a new Secure Authentication Key Agreement Protocol (S-AKA) is proposed in this paper to enhance the security to resist the attacks. To improve the efficiency and redundancy of UNITS AKA, S-AKA reduces both the authentication messages and bandwidth consumption of UNITS AKA. The formal proof of S-AKA is also given to ensure the security strength of S-AKA.
SEA: Secure Encrypted-data Aggregation in mobile wireless sensor networks
(2007)
Huang, Shih-I
;
Shieh, Shiuhpyng
;
資訊工程學系
;
Department of Computer Science
This paper proposes a Secure Encrypted-data Aggregation (SEA) scheme in mobile wireless sensor networks (MWSN) environment. Our design for data aggregation eliminates redundant sensor readings without using encryption and maintains data secrecy and privacy during transmission. In contrast to conventional schemes, our proposed scheme provides security and privacy, and duplicate instances of original readings will be aggregated into a single packet: therefore, more energy can be saved.
Secure authentication protocols resistant to guessing attacks
(2006-09-01)
Luo, Jia-Ning
;
Shieh, Shiuhpyng
;
Shen, Ji-Chiang
;
資訊工程學系
;
Department of Computer Science
Users are normally authenticated via their passwords in computer systems. Since people tend to choose passwords that can be easily remembered, the systems are under the threat of guessing attacks. Many authentication and key distribution protocols have been proposed to protect user passwords from guessing attacks. However, these protocols either are limited to some specific environments or incur high computation and communication costs. In the paper, we first specify five common forms of guessing attacks, which are used to determine whether a protocol is vulnerable to those attacks. Based on these common forms, some guidelines are provided for developing secure protocols that can be used in both symmetric and asymmetric cryptosystems to defend against guessing attacks. Finally, we enhance the well-known authentication system Kerberos and propose two authentication and key distribution protocols, which are both resistant to guessing attacks.
Secure encrypted-data aggregation for wireless sensor networks
(2010-05-01)
Huang, Shih-I
;
Shieh, Shiuhpyng
;
Tygar, J. D.
;
交大名義發表
;
資訊工程學系
This paper proposes a secure encrypted-data aggregation scheme for wireless sensor networks. Our design for data aggregation eliminates redundant sensor readings without using encryption and maintains data secrecy and privacy during transmission. Conventional aggregation functions operate when readings are received in plaintext. If readings are encrypted, aggregation requires decryption creating extra overhead and key management issues. In contrast to conventional schemes, our proposed scheme provides security and privacy, and duplicate instances of original readings will be aggregated into a single packet. Our scheme is resilient to known-plaintext attacks, chosen-plaintext attacks, ciphertext-only attacks and man-in-the-middle attacks. Our experiments show that our proposed aggregation method significantly reduces communication overhead and can be practically implemented in on-the-shelf sensor platforms.
Tracing Mobile Attackers in Wireless Ad-Hoc Network
(2008)
Yang, Ming Hour
;
Chiu, Chien-Si
;
Shieh, Shiuhpyng
;
資訊工程學系
;
Department of Computer Science
In a flooding-based distributed denial-of-service (DDoS) attack, an adversary attempts to exhaust a target\'s computing resource. To detect DDoS attacks in a network environment, IP traceback methods are deployed to determine the origin of attacking packets. With the increase in bandwidth of wireless networks, attackers may choose this medium from which to launch attacks. However, tracing the attackers in wireless networks is more difficult since intermediate nodes may move or attackers may change their location to hide themselves. Thus, conventional traceback schemes for wired networks cannot apply directly to the wireless network infrastructure because the intermediate routers could be compromised by an adversary. Therefore, we propose a flexible and lightweight traceback scheme to determine the source of attacking packets in a mobile ad-hoc environment. We will demonstrate our method\'s ability to track the movement of an attacker and recognize attack traffic launched by the same attacker from different locations.
VMCloak: Toward a Stealthy in-VM Agent Execution
(2017-01-01)
Wang, Chiawei
;
Shieh, Shiuhpyng
;
交大名義發表
;
National Chiao Tung University
In-VM agent programs are generally used for the convenience of VM monitor in malware analysis. To prevent malicious interference, the stealthy execution of an in-VM agent is desirable. Existing approaches for stealthy execution of the agent remains detectable if libraries or kernel code of the guest OS is contaminated by malware. Moreover, the lack of applicability to conventional executables limits the agent functionality. In this paper, VMCloak is proposed for the stealthy in-VM agent execution. Our scheme leverages the virtualization technology to perform the real-time binary instrumentation to conceal the fingerprints of an in-VM agent from potential detection. Both stealthiness and integrity of the agent are guaranteed even when the guest OS is compromised. The evaluation shows that VMCloak can cope with the applicability issues, allowing the in-VM agent to perform the same operations as that of ordinary executables.