Hui Tian

Prof. Hui Tian

College of Computer Science and Technology, National Huaqiao University, Xiamen 361021, China
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
25 December 2015 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
Hui TianHui Tian
Hui Tian
YCYuxiang Chen
Yuxiang Chen
CCChin-Chen Chang
Chin-Chen Chang
HJHong Jiang
Hong Jiang
YHYongfeng Huang
Yongfeng Huang
JLJin Liu
Jin Liu
Cloud storage is an increasingly popular application of cloud computing, which can provide on-demand outsourcing data services for both organizations and individuals. However, users may not fully trust the cloud service providers (CSPs) in that it is difficult to determine whether the CSPs meet their legal expectations for data security. Therefore, it is critical to develop efficient auditing techniques to strengthen data owners' trust and confidence in cloud storage. In this paper, we present a novel public auditing scheme for secure cloud storage based on dynamic hash table (DHT), which is a new two-dimensional data structure located at a third parity auditor (TPA) to record the data property information for dynamic auditing. Differing from the existing works, the proposed scheme migrates the authorized information from the CSP to the TPA, and thereby significantly reduces the computational cost and communication overhead. Meanwhile, exploiting the structural advantages of the DHT, our scheme can also achieve higher updating efficiency than the state-of-the-art schemes. In addition, we extend our scheme to support privacy preservation by combining the homomorphic authenticator based on the public key with the random masking generated by the TPA, and achieve batch auditing by employing the aggregate BLS signature technique. We formally prove the security of the proposed scheme, and evaluate the auditing performance by detailed experiments and comparisons with the existing ones. The results demonstrate that the proposed scheme can effectively achieve secure auditing for cloud storage, and outperforms the previous schemes in computation complexity, storage costs and communication overhead.

18 July 2023 in Measurement
Verified
Journal Article
Closed access
LTLili Tang
Lili Tang
Hui TianHui Tian
Hui Tian
HHHui Huang
Hui Huang
SSShuangjin Shi
Shuangjin Shi
QJQingzhi Ji
Qingzhi Ji

1 April 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
TWTian Wang
Tian Wang
JZJiandian Zeng
Jiandian Zeng
YLYongxuan Lai
Yongxuan Lai
YCYiqiao Cai
Yiqiao Cai
Hui TianHui Tian
Hui Tian
BWBaowei Wang
Baowei Wang

1 February 2019 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
Hui TianHui Tian
Hui Tian
FNFulin Nan
Fulin Nan
CCChin-Chen Chang
Chin-Chen Chang
YHYongfeng Huang
Yongfeng Huang
JLJing Lu
Jing Lu
YDYongqian Du
Yongqian Du

3 May 2017 in IEEE Access
Verified
Journal Article
Open access
TWTian Wang
Tian Wang
JZJiandian Zeng
Jiandian Zeng
MBMd Zakirul Alam Bhuiyan
Md Zakirul Alam Bhuiyan
Hui TianHui Tian
Hui Tian
YCYiqiao Cai
Yiqiao Cai
BZBineng Zhong
Bineng Zhong
The development of mobile cloud computing technology has made location-based service (LBS) increasingly more popular. Given the continuous requests to cloud LBS servers, the amounts of location and trajectory information collected by LBS servers are continuously increasing. Privacy awareness for LBS has been extensively studied in recent years. Among the privacy concerns about LBS, trajectory privacy preservation is particularly important. Based on privacy preservation models, previous work have mainly focused on peer-to-peer and centralized architectures. However, the burden on users is heavy in peer-to-peer architectures, because user devices need to communicate with LBS servers directly. In centralized architectures, a trusted third party (TTP) is introduced, and acts as a bridge between users and the LBS server. Anonymity technologies, such as k-anonymity, mix-zone, and dummy technologies, are usually implemented by the TTP to ensure safety. There are certain drawbacks in TTP architectures: Users have no physical control of the TTP. Moreover, the TTP is more attractive to adversaries, because substantially more sensitive information is stored by the TTP. To solve the above-mentioned problems, in this paper, we propose a fog structure to store partial important data with the dummy anonymity technology to ensure physical control, which can be considered as absolutely trust. Compared with cloud computing, fog computing is a promising technique that extends the cloud computing to the edge of a network. Moreover, fog computing provides local computation and storage abilities, wide geo-distribution, and support for mobility. Therefore, mobile users' partial important information can be stored on a fog server to ensure better management. We take the principles of similarity, intersection, practicability, and correlation into consideration and design a dummy rotation algorithm with several properties. The effectiveness of the proposed method is validated through extensive simulations, which show that the proposed method can provide enhanced privacy preservation.

1 January 2019 in Information Sciences
Verified
Journal Article
Closed access
Hui TianHui Tian
Hui Tian
FNFulin Nan
Fulin Nan
HJHong Jiang
Hong Jiang
Chin-Chen ChangChin-Chen Chang
Chin-Chen Chang
JNJianting Ning
Jianting Ning
YHYongfeng Huang
Yongfeng Huang