Jeng-Shyang Pan

Bio: Jeng-Shyang Pan is an academic researcher from Shandong University of Science and Technology. The author has contributed to research in topics: Digital watermarking & Watermark. The author has an hindex of 50, co-authored 789 publications receiving 11645 citations. Previous affiliations of Jeng-Shyang Pan include National Kaohsiung Normal University & Technical University of Ostrava.

Reversible Watermarking Based on the Invariant Sum Value

Abstract: A novel reversible data hiding scheme based on the invariant sum values of pixel pairs is presented in this paper. For each pixel pair, if a certain value is added to one pixel while the same value is subtracted from the other pixel, then the sum of these two pixels will remain unchanged. This value is selected as the half of difference plus 1-bit watermark considering the distortion control and the reversibility of the algorithm. The watermark bit can be extracted by using the invariability of the sum values and the equality property between the parities of the sum values and the difference values. The experimental results reveal that the proposed method has comparable performance with the traditional difference expansion method in visual quality and embedding capacity.

Cryptanalysis of an Anonymous Mutual Authentication Scheme in Mobile Networks

Abstract: With the rapid development of mobile networks, secure communication technologies for mobile users are received much attentions from researchers. Recently, Chung et al. proposed an anonymous mutual authentication scheme for communication inter-devices in mobile networks. Some previous literatures are shown that their scheme has some security weaknesses. In this paper, we also point out their scheme violates perfect forward secrecy and is insecure against a replay attack.

A Comprehensive Evaluation Model for Traffic Rule

Abstract: This article puts forward a model aimed at evaluating the traffic rule. We build the evaluating models to measure the traffic influencing factors, which can be divided into two kinds, the traffic flow factor and the safety factor. Analyze these factors to judge the performance of the keep-right-except-to-pass rule in light and heavy traffic. Draw the curve about time and other factors, let time be the intermediate variable, by using the figure conversion method, we get the curve in order to analyze the changing situation of each factor in light and heavy traffic. Do the comprehensive analysis of the combination figure by putting all the three curves in one coordinate system. We further set the basic lines as standards to be compared with the observing values. The result shows keep-right-except-to-pass rule performs well in the normal traffic yet badly in the extremely light traffic and the extremely heavy traffic.

Double-Domains-Based Covert Communication Scheme for a RS-Code-Based Multiple Description Image Coding System

Abstract: In this paper, a covert communication scheme is proposed for a RS-code-based multiple description image coding system. Firstly, the secret information is embedded in the carrier image by the double-domains based method. And then the carrier image is encoded with the SPIHT algorithm. The SPIHT stream is delivered through the RS-code-based multiple description image coding system to conquer the channel errors. During the information hiding phase, the embedding order and the embedding parameters are carefully selected to ensure that the secret information can exist in the pixel domain and in the DWT domain peacefully. During the SPIHT encoding phase, the appropriate parameters are selected to balance the compression rate and the visual quality of the recovered carrier image. During the transmission phase, the appropriate structure is selected according to the channel conditions. The experimental results show the effectiveness of the proposed covert communication scheme.

Generalized Benford’s Distribution for Data Defined on Irregular Grid

Abstract: In forensic analysis, such as forensic auditing, multimedia forensic, and financial fraud detection, the auditor needs to detect data tempering to find clue for possible fraud. First digit distribution such as Benford’s law is proved to be an efficient tool and is used by many auditing companies to preprocess the data before the actual auditing. However, when the range of the data is limited, the first digit distribution usually does not conform to Benford’s law. Using temperature data from a sensor network, we show that if the data can be modeled by a graph signal model, then after the graph Fourier transformation, the distribution of first digits conforms to a generalized Benford’s law. In addition, a graphic model based on historical data provides better fit to the Benford’s model than that based on geodesic distance. This model is evaluated for simulated data and temperature sensor network. This finding may help to build models for forensic analysis of accounting data and sensor network data for fraud detection.

Mean shift: a robust approach toward feature space analysis

Abstract: A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure: the mean shift. For discrete data, we prove the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density. The relation of the mean shift procedure to the Nadaraya-Watson estimator from kernel regression and the robust M-estimators; of location is also established. Algorithms for two low-level vision tasks discontinuity-preserving smoothing and image segmentation - are described as applications. In these algorithms, the only user-set parameter is the resolution of the analysis, and either gray-level or color images are accepted as input. Extensive experimental results illustrate their excellent performance.

Digital Watermarking

Abstract: Digital watermarking is a key ingredient to copyright protection. It provides a solution to illegal copying of digital material and has many other useful applications such as broadcast monitoring and the recording of electronic transactions. Now, for the first time, there is a book that focuses exclusively on this exciting technology. Digital Watermarking covers the crucial research findings in the field: it explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied. As a result, additional groundwork is laid for future developments in this field, helping the reader understand and anticipate new approaches and applications.

PORs: Proofs of Retrievability for Large Files

Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.