Wen-Chung Kuo

A Data Hiding Scheme with High Embedding Capacity Based on General Improving Exploiting Modification Direction Method

Data hiding is one of the most important strategies on the field of data security; the main purpose of data hiding is to disguise the secret information and put them behind a cover image to make them unnoticeable and to assure the secrecy as a stego-image. Besides safety, the quantity of data that can be hidden in a single cover image is also very important to the data encryption. In this paper, we propose two kinds of weight-changing evaluation of high capacity EMD data hiding strategies that formulas can be open to the public; one of them is using table-checking to change the weighting evaluation of high capacity EMD data hiding strategy, the other is using generalize of high capacity EMD data hiding; both strategies can improve the safety problem when opening the formula to the public.

High Embedding Reversible Data Hiding Scheme for JPEG

Both Data hiding and data compression are very important technologies in the field of image processing. It seems that there is no relationship between data hiding and data compression because most of the data hiding mechanisms focus on information security and the data compression mechanisms emphasize the compression ratio. In fact, they are closely related. Until now, there are many literatures to discuss the secret data how to be embedded into the media image. Unfortunately, the stego-image’s size will be increased when the media image is hidden a lot of secret data. In order to overcome this disadvantage, a reversible data hiding scheme based on EMD data hiding and JPEG compression technology will be proposed in this paper. According to the experimental results, we can prove that our proposed scheme still keeps high embedding capacity, security and good compression ratio.

Zero-Collision RFID Tags Identification Based on CDMA

One of the killer applications for Radio frequency identification (RFID) system is the automatic identification of physical objects. To do that, each object must be labeled with a RFID tag containing identifying data. However, collisions occur when several tags send their data simultaneously. This paper proposes a secure scheme for zero-collision RFID tags identification based on Code Division Multiple Access (CDMA) and hash-chain mechanics. The scheme not only allows several tags send their identifying data simultaneously without collision, but also provides the following secure properties for RFID reader and tags: mutual authentication, tag anonymity, robustness and forward secrecy.

Adaptive reversible data hiding based on histogram

Due to the development of internet rapidly, the secure transmission of information has become more and more importance. Until now, there are many scholars study in the topic of data hiding. Specially, the reversible data hiding scheme catch the researchers attention. No matter how the researchers use the different technology to embed the secret information, they always try to increase the hide space within the permission quality of the cover image. However, the hiding positions are subject to the highest point by using the NSAS-scheme or HKC-scheme. To overcome this shortcoming, a reversible data hiding based on adaptive hiding location will be proposed in this paper. According to the experimental results, we can prove that our proposed scheme still not only keeps high embedding capacity and stego-image quality but also maintain the better security

Detour Routing Protocol for Geographic Sensor Networks

Routing in sensor networks is a challenging research topic due to the barriers (holes) on the natural topography often causing routing algorithms to fail. Most geographic routing algorithms in sensor networks apply the greedy forwarding method to discovery a path to the destination without the global states. However, greedy forwarding could fail because the local minima problem. In this paper, we propose a novel algorithm called Detour Routing based on Quadrant Classification (DRQC), to reduce the occurrence of the local minima problem by avoiding sending packages to the nodes which could have the local minima problem. The basic idea of DRQC is based on that each node knows the geographic information of its 2-hop neighbors, and then each node decides its state: red or white. A red node has no local minima problem, but a white node could have local minima problem. DRQC requires that each node chooses one of its 2-hop neighbors, which is red and whose distance to the destination is the shortest one, as the next hop for forwarding a packet. If no such a neighbor exists, then traditional 2-hop Greedy scheme is applied to select the next forwarding node. We implement the DRQC algorithm and compare it with two algorithms: 1-hop greedy and 2-hop greedy. Simulation results show that our algorithm (DRQC) has higher packet delivery rate (96%) than the two algorithms: 1-hop Greedy (79%) and 2-hop Greedy (87%).

A Robust Remote User Authentication Scheme Using Smart Card

In 2008, Yoon et al. [25] presented three kinds of security attacks (YLY attacks for short) of a user authentication and key agreement scheme using smart cards in different scenarios. The YLY attacks are: perfect forward secrecy, the guessing attack, and the Denning-Sacco attack. The main goal of this paper is to propose a robust remote user authentication scheme using smart card that could not only withstand the traditional attacks, such as, the man-in-the-middle attack, the replay attack, the forgery attacks, the stolen smart card attack, and the denial of service attack, but also overcomes YLY attacks.

An Improvement Data Hiding Scheme Based on Formula Fully Exploiting Modification Directions and Pixel Value Differencing Method

Recently, a modified data hiding scheme based on pixel value differencing and improving exploiting modification directions is proposed by Shen and Huang. There are two major contributions in this scheme. One is to enhance the embedding rate and good embedding capacity and the other is an optimization problem used to solve the overflow/ underflow problem. In fact, they propose the similar brute force method to solve overflow/underflow problem in their proposed scheme. To overcome the overflow/underflow problem exactly, we will propose the close form to solve this problem in this paper. Then, an improvement data hiding scheme based on FFEMD (Formula Fully Exploiting Modification Directions) and pixel value differencing method is proposed. According to our analysis, it is not only to keep the advantages of Shen-Huang scheme but also to use the close form to solve the overflow/ underflow problem.

Security on the Design of RFID Access Control Protocol Using the Strategy of Indefinite-Index and Challenge-Response

Chen, Tsai, and Jan (Chen et al. for short) recently proposed a Radio Frequency Identification (RFID) access control scheme, which includes an authentication mechanism and an access right authorization mechanism designed for a low-cost RFID system. Chen et al. does not only show security weaknesses of Weiss and Chiens access control schemes, but also claim their proposed scheme can resist the man-in-the-middle attack, the spoofed reader attack, the spoofed tag attack and guarantee mutual authentication and location privacy. However, we found that Chen et al.s scheme is vulnerable to the impersonating reader attack and does not have any defense mechanism against denial-of-service (DoS) attack such as resource exhaustion attack. In this paper, we will show that Chen et al.s scheme is insecure and suffers from aforementioned potential security vulnerabilities.

High Flexible Sanitizing Signature Scheme Based on Bilinear Maps

A sanitizable signature scheme allows the sanitizer to alter the signed document using a disclosed policy that does not break the signing protocol. However, existing sanitizable signature schemes do not restrict the sanitizer, which leads to dishonest sanitizer and additional sanitizing problems. In this paper, a high flexible sanitizing signature scheme based on the bilinear mapping method that uses an arbiter to resolve the security problem is proposed. A security analysis shows that the proposed scheme retains the security requirement of sanitizable signatures and mitigates the disadvantages of related schemes.

Digitally signed document flexible sanitizing scheme based on bilinear maps

In 2001, the sanitizable signature was proposed by Steinfeld et al. Until now, many sanitizable signature schemes have been proposed. However, current sanitizable signature schemes are faced with the dishonest sanitizer or additional sanitizing problem due to the sanitizer can modify the signed document unrestrictedly. Therefore, a flexible sanitizable signature scheme based on bilinear mapping will be proposed in this paper. According to our security analysis, this proposed scheme is not only to keep the security requirement of sanitizable signature but also improve the disadvantage of related schemes.