Shaohua Tang

Shaohua Tang

Auto-generated profile, based on publicly available information

Shaohua Tang

School of Computer Science and Engineering, South China University of Technology, Guangzhou, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
BZBowen Zhao
Bowen Zhao
STShaohua Tang
Shaohua Tang
Ximeng LiuXimeng Liu
Ximeng Liu
XZXinglin Zhang
Xinglin Zhang
Providing appropriate monetary rewards is an efficient way for mobile crowdsensing to motivate the participation of task participants. However, a monetary incentive mechanism is generally challenging to prevent malicious task participants and a dishonest task requester. Moreover, prior quality-aware incentive schemes are usually failed to preserve the privacy of task participants. Meanwhile, most existing privacy-preserving incentive schemes ignore the data quality of task participants. To tackle these issues, we propose a privacy-preserving and data quality-aware incentive scheme, called PACE. In particular, data quality consists of the reliability and deviation of data. Specifically, we first propose a zero-knowledge model of data reliability estimation that can protect data privacy while assessing data reliability. Then, we quantify the data quality based on the deviation between reliable data and the ground truth. Finally, we distribute monetary rewards to task participants according to their data quality. To demonstrate the effectiveness and efficiency of PACE, we evaluate it in a real-world dataset. The evaluation and analysis results show that PACE can prevent malicious behaviors of task participants and a task requester, and achieves both privacy-preserving and data quality measurement of task participants.

28 September 2016 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
XZXinglin Zhang
Xinglin Zhang
ZYZheng Yang
Zheng Yang
YLYunhao Liu
Yunhao Liu
STShaohua Tang
Shaohua Tang
The large quantity of mobile devices equipped with various built-in sensors and the easy access to the high-speed wireless networks have made spatial crowdsourcing receive much attention in the research community recently. Generally, the objective of spatial crowdsourcing is to outsource location-based sensing tasks (e.g., traffic monitoring and pollution monitoring) to ordinary mobile workers (e.g., users carrying smartphones) efficiently. In this paper, we study a reliable task assignment problem for spatial crowdsourcing in a large worker market. Specifically, we use worker confidence to represent the reliability of successfully completing the assigned sensing tasks, and we formulate two optimization problems, maximum reliability assignment (MRA) under a recruitment budget and minimum cost assignment (MCA) under a task reliability requirement. We reveal the special structure properties of these problems, based on which we design effective approaches to assign tasks to the most suitable workers. The performances of the proposed algorithms are verified by theoretic analysis and experimental results on both real and synthetic datasets.

4 June 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
BZBowen Zhao
Bowen Zhao
STShaohua Tang
Shaohua Tang
Ximeng LiuXimeng Liu
Ximeng Liu
XZXinglin Zhang
Xinglin Zhang
WCWei-Neng Chen
Wei-Neng Chen
The minimum travel distance of task participants is one of the significant optimization objectives of privacy-preserving task assignment in mobile crowdsensing (MCS). However, when the travel distance is minimized, most of the previous schemes only focus on the task participant privacy and disregard the task requester privacy. Moreover, existing solutions usually only support the constraint of a single type, such as equality constraints or range constraints. In this paper, we propose a bilateral privacy-preserving Task Assignment mechanism for MCS (iTAM), which protects not only the task participants privacy but also the task requesters privacy and can minimize the travel distance. Furthermore, iTAM provides both equality and range constraints of task assignment by utilizing the Paillier cryptosystem. To accommodate the multiple relations between the task participants and the task, we propose the single/multiple task participants selection problems for a task requiring task participants to compete and cooperate. Experimental evaluations over synthetic and real-world data illustrate that iTAM is feasible and effective. Compared with the state-of-the-art, iTAM positively solves the optimal problem of travel distance. The complexities of iTAM are $\mathcal {O}(n)$ and $\mathcal {O}(n\log n)$ for a single and multiple task participants selection problems, respectively.

22 November 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
JHJunhui He
Junhui He
JCJunxi Chen
Junxi Chen
WLWeiqi Luo
Weiqi Luo
STShaohua Tang
Shaohua Tang
JHJiwu Huang
Jiwu Huang
As cloud storage becomes more common, concerns about the invasion of privacy are increasing. When images are stored in an encrypted form in the public cloud, reversible data hiding in the encrypted domain can be applied to embed additional data within the encrypted images for ease of management. Most existing works focus on uncompressed images and are not applicable to JPEG images, which are widely used throughout the Internet. Therefore, in this paper, a novel reversible data hiding scheme for encrypted JPEG bitstreams is proposed. First, an effective method of bitstream-based JPEG image encryption is employed to encrypt plaintext JPEG images. Then, we present a reversible data hiding technique for encrypted JPEG images based on invariant zero-run length in the zero-run value pairs. In the cloud, additional data, such as labels, timestamps, origins and authentication messages, are directly embedded into the encrypted JPEG images with our proposed data hiding technique. From the marked encrypted JPEG images, the extraction of the hidden data and the recovery of the original images can be done independently. Extensive experiments performed on several typical images and three well-known image databases show that the proposed scheme can achieve much higher embedding capacity than that of most recent schemes, and the file sizes of the marked encrypted JPEG images are well preserved compared to those of the related methods. In addition, we provide further analysis to show that the proposed scheme has good format compatibility and low computational complexity.

9 April 2019 in IEEE Access
Verified
Journal Article
Open access
YWYiming Wu
Yiming Wu
STShaohua Tang
Shaohua Tang
BZBowen Zhao
Bowen Zhao
ZPZhiniang Peng
Zhiniang Peng
Task matching in crowdsourcing is designed to provide convenient task information retrieval and has been extensively explored. In general, the task matching process is required to be reliable and to meet privacy requirements. However, most existing privacy-preserving task matching solutions for crowdsourcing focus on privacy issues but ignore the reliability of the process. In this paper, we propose a blockchain-based task matching scheme for crowdsourcing with a secure and reliable matching. Instead of utilizing a centralized cloud server, we employ smart contracts, an emerging blockchain technology, to provide reliable and transparent matching. In this way, data confidentiality and identity anonymity are achieved effectively and efficiently. The extensive privacy analysis and performance evaluation show that our solution is secure and feasible.

10 December 2019 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JHJunhui He
Junhui He
JCJunxi Chen
Junxi Chen
STShaohua Tang
Shaohua Tang