scispace - formally typeset
Search or ask a question
Author

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.


Papers
More filters
Book ChapterDOI
26 Aug 2015
TL;DR: An efficient algorithm is proposed to minimize side effects in the sanitization process for hiding sensitive high utility itemsets and three similarity measurements are designed as the new standard used in PPUM.
Abstract: High-Utility Itemset Mining (HUIM) considers both quantity and profit factors to measure whether an item or itemset is a profitable product. With the rapid growth of security considerations, privacy-preserving utility mining (PPUM) has become a critical issue in HUIM. In this paper, an efficient algorithm is proposed to minimize side effects in the sanitization process for hiding sensitive high utility itemsets. Three similarity measurements are also designed as the new standard used in PPUM. Experiments are also conducted to show the performance of the designed algorithm in terms of general side effects in PPDM and the new defined measurements in PPUM.

3 citations

Proceedings ArticleDOI
01 Aug 2012
TL;DR: This paper proposed a refined efficient identity-based threshold proxy signature in the cloud environment that is not only practical but also enjoys fewer rounds of communication and less operation cost in comparison to the existing schemes.
Abstract: Threshold proxy signature is more practical, flexible and secure than traditional proxy signature and multi-proxy signature schemes. However, the majority of existing identity-based threshold proxy signature schemes is still inefficient and impractical. Cloud services allow users to create, store, edit, and read electronic documents on the internet conveniently. While access control mechanisms enable communications between user terminals and the cloud to be executed securely and in a trusted manner. In this paper, we proposed a refined efficient identity-based threshold proxy signature in the cloud environment. Our approach is not only practical but also enjoys fewer rounds of communication and less operation cost in comparison to the existing schemes. In this paper, we have also introduced the implementation of our approach in the cloud environment.

3 citations

Book ChapterDOI
06 Nov 2017
TL;DR: A directional shuffled frog leaping algorithm (DSFLA) is proposed by introducing the directional updating and real-time interacting concepts and results show that the proposed approach is a very effective method for solving test functions.
Abstract: Shuffled frog leaping algorithm is one of the popular used optimization algorithms. This algorithm includes the local search and global search two solving modes, but in this method only the worst frog from divided group is considered for improving location. In this paper, we propose a directional shuffled frog leaping algorithm (DSFLA) by introducing the directional updating and real-time interacting concepts. A direction flag is set for a frog before moving, if the frog goes better in a certain direction, it will get better in a big probability by moving a little further along that direction. The movement counter is set for preventing the frog move forward infinite. Real-time interacting works by sharing the currently optimal positions from the other groups. There should have some similarities among the best ones, and the worst individual could be improved by using those similarities. The experimental results show that the proposed approach is a very effective method for solving test functions.

3 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: It is proved 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.
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.

11,727 citations

Book
24 Oct 2001
TL;DR: Digital Watermarking covers the crucial research findings in the field and 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.
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.

2,849 citations

Proceedings Article
01 Jan 1999

2,010 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user 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.
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.

1,783 citations