scispace - formally typeset
Search or ask a question

Showing papers by "Chin-Ling Chen published in 2008"


Journal ArticleDOI
TL;DR: This work proposes an efficient digital rights management protocol that integrates digital certificate, hardware information and one time password mechanisms such that the security, persistent protection, integrity, authentication, track usage of DRM work, changeable access right, integration and portability issues will be assured.
Abstract: In recent years, intellectual property violation events have caused enterprise to respect digital content protection. Illegal copying digital content abuses become a serious problem. Because the mobile devices are more portable and individualized than personal computers, anyone can access the network resources at anytime from anywhere. However, valuable digital contents without proper protection make the content vulnerable to unauthorized copying, modification and re-distribution, causing revenue losses to service providers. Thus, constructing an effective Digital Right Management (DRM) system has become an important issue. On the basis of the mobile device, we propose an efficient digital rights management protocol. We apply symmetrical cryptosystem, asymmetrical cryptosystem, digital signature and one-way hash function mechanisms in our scheme. To overcome the computing resource weakness problem of mobile devices, we also integrate digital certificate, hardware information and one time password mechanisms such that the security, persistent protection, integrity, authentication, track usage of DRM work, changeable access right, integration and portability issues will be assured. In this way, the mobile user can access the digital content securely in the enterprise via authorization mechanism.

43 citations


Journal ArticleDOI
TL;DR: This work proposes a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods and lower the probability of thekey to being guessed correctly.
Abstract: Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

28 citations


Journal Article
TL;DR: This paper proposes a distributed cluster-based QoS multicast routing algorithm which only requires maintaining a local state at each node and has better performance and lower routing overhead than the non-cluster based algorithm.
Abstract: Wireless network offers freedom moving around the effective transmission area and the flexibility and easy to use function for Internet application. Many applications of computer network involve multiple users that will rely on the ability of the network to provide multicast services. Thus, multicasting will be concerned as an essential part of Ad Hoc networks. Some of the proposed routing algorithms require maintaining a global network state at each node, the imprecision of global state and the large amount of storage and communication overhead induce poor scalability. In this paper, we propose a distributed cluster-based QoS multicast routing algorithm which only requires maintaining a local state at each node. The location information provided by positioning device is aided in route discovery and route maintenance procedure. Our protocol partitions the network into square clusters. In each cluster, a cluster head and gateways are selected by a cluster head selection algorithm and a gateway selection algorithm respectively. After the construction of cluster heads and gateway nodes, a distributed computation collectively utilizes the local state information to construct multicast tree in a hop-by-hop basis. Simulations are conducted to evaluate the performance of our algorithm. As it turns out, our protocol has better performance and lower routing overhead than the non-cluster based algorithm.

13 citations


Journal Article
TL;DR: In this article, an anti-counterfeit ownership transfer protocol for low-cost RFID system is proposed, which only uses a tag to be a storage media and can ensure a secure transaction.
Abstract: Radio Frequency Identification (RFID) is a new technology. In recent years, it is convenient and feasible in many applications. However, it also addresses many security issues which are worth discussing. The Counterfeit imposes a menace to industry worldwide, and the problem is not specific for certain products or countries. In 2003, Koh et al. describe a RFID system based on "track and trace" solution to apply into pharmaceutical supply chain management to fight the counterfeit. Moreover, there are applications to solve malicious manner were presented. But there always still existed some disputes and not conform Class 1 Generation 2 (C1G2) standards. Unfortunately, the trick is changeable. The Koh et al.'s scheme is at premise rather primitive. In order to tackle this problem, we propose an anti-counterfeit ownership transfer protocol for low cost RFID system. We only use a tag to be a storage media. The proposed scheme can ensure a secure transaction.

12 citations


Proceedings ArticleDOI
21 Nov 2008
TL;DR: The proposed mechanism is demonstrated to have the capability of detecting DDoS attack accurately and to set up a threshold for maximum arrival rate to detect DDoS flood traffic.
Abstract: This study has proposed a new detection method for DDoS attack traffic based on statistical test. We first investigate the statistics of SYN arrival rate and find that SYN arrival rate can be can be modeled by normal distribution. We set up a threshold for maximum arrival rate to detect DDoS flood traffic. We also establish a threshold for incomplete three-way handshaking packet ratio to detect possible DDoS traffic. The experiment results show that the possibilities of both false positives and false negatives are very low. The proposed mechanism is demonstrated to have the capability of detecting DDoS attack accurately.

6 citations


Proceedings ArticleDOI
26 May 2008
TL;DR: In this paper, a novel adaptive segment repair scheme is proposed to improve traditional MPLS failure recovery by setting up the segment protection dynamically to obtain balance between resource utilization and fast restoration.
Abstract: We propose a novel adaptive segment repair scheme to improve traditional MPLS (multi-protocol label switching) failure recovery. The proposed mechanism protects one or more contiguous high failure probability links by setup the segment protection dynamically. The adaptive segment repair scheme aims to obtain balance between resource utilization and fast restoration. With the simulation results, the proposed scheme is demonstrated to reduce failure recovery time as well as increase network resources utilization.

3 citations


Journal IssueDOI
TL;DR: This paper proposes using a PTD as a payment tool in a mobile transaction system for public transportation and uses a trusted observer to coordinate the mobile transaction and to integrate cryptology (such as a digital signature and a one-way hash function).
Abstract: Advances in wireless network technology and the increasing number of users of the personal trusted device (PTD) make the PTD an ideal channel for offering personalized services to mobile users. In this paper, we propose using a PTD as a payment tool in a mobile transaction system for public transportation. To overcome the inherent weakness of computing resources in a PTD, we use a trusted observer to coordinate the mobile transaction and to integrate cryptology (such as a digital signature and a one-way hash function). The proposed scheme satisfies the requirements for mobile transactions. These requirements include fairness, non-repudiation, anonymity, off-line capability, no forgery, efficient verification, simplicity, and practicability. Because a PTD is more portable and personal than a personal computer and because the public transportation can be a necessity in our daily lives, our scheme proposes a novel use of PTDs in mobile commerce. Copyright © 2008 John Wiley & Sons, Ltd.

2 citations


Journal Article
TL;DR: Through one-time password authentication and secret sharing technology, the cooperative signature of the server and the handheld device is generated to satisfy the issues of security, non-repudiation, simplicity, validity, and mobility.
Abstract: With the progress of the mobile communication technology and the popularity of the handheld devices, mobile commerce is of great importance today. We can use these devices to conduct business, such as to purchase books, and stocks, and digital goods (videos, audios, codes), and to play games, receive email, and even access various network resources. When the requested services need to be verified, the authentication of users and the non-repudiation of transactions become very important. Completing these tasks in wireless environments is a challenge for mobile devices that have limited computational capabilities. In this paper, we propose a server-aided signature scheme based on secret sharing for mobile commerce. Through one-time password authentication and secret sharing technology, we generate the cooperative signature of the server and the handheld device to satisfy the issues of security, non-repudiation, simplicity, validity, and mobility.

1 citations


02 Jul 2008
TL;DR: This paper proposes a distributed cluster-based QoS multicast routing algorithm which only requires maintaining a local state at each node and has better performance and lower routing overhead than the non-cluster based algorithm.
Abstract: Multicasting will be concerned as an essential part of mobile Ad Hoc networks. Many proposed routing algorithms require maintaining a global network state at each node, the imprecision of global state and the large amount of storage and communication overhead induce poor scalability. In this paper, we propose a distributed cluster-based QoS multicast routing algorithm which only requires maintaining a local state at each node. Our protocol partitions the network into square clusters. In each cluster, a cluster head and gateways are selected. Then, a distributed computation collectively utilizes the local state information to construct multicast tree in a hop-by-hop basis. Simulations are conducted to evaluate the performance of our algorithm. As it turns out, our protocol has better performance and lower routing overhead than the non-cluster based algorithm. Key-Words: mobile ad hoc network, multicasting, loop-free, proactive, reactive † Corresponding author.

1 citations


Proceedings ArticleDOI
23 Mar 2008
TL;DR: A multi-mode user agent system that integrates with radio frequency identification (RFID) and kind of context is defined to detect the location of the users and the possible digital services for the specified users are proposed.
Abstract: In this paper, we propose a multi-mode user agent system that integrates with radio frequency identification (RFID) and kind of context we define to detect the location of the users. The users can dynamically deploy the services they want based on both active and passive identification framework. The multi-mode UA is in charge of monitoring the current location status of users and providing the possible digital services for the specified users.