Yinghui Zhang

Dr. Yinghui Zhang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
13 August 2018 in Sensors
Verified
Journal Article
Open access
PDF file
YZYinghui Zhang
Yinghui Zhang
JZJiangfan Zhao
Jiangfan Zhao
DZDong Zheng
Dong Zheng
KDKaixin Deng
Kaixin Deng
FRFangyuan Ren
Fangyuan Ren
Jiangang ShuJiangang Shu
Jiangang Shu
As an extension of cloud computing, fog computing has received more attention in recent years. It can solve problems such as high latency, lack of support for mobility and location awareness in cloud computing. In the Internet of Things (IoT), a series of IoT devices can be connected to the fog nodes that assist a cloud service center to store and process a part of data in advance. Not only can it reduce the pressure of processing data, but also improve the real-time and service quality. However, data processing at fog nodes suffers from many challenging issues, such as false data injection attacks, data modification attacks, and IoT devices’ privacy violation. In this paper, based on the Paillier homomorphic encryption scheme, we use blinding factors to design a privacy-preserving data aggregation scheme in fog computing. No matter whether the fog node and the cloud control center are honest or not, the proposed scheme ensures that the injection data is from legal IoT devices and is not modified and leaked. The proposed scheme also has fault tolerance, which means that the collection of data from other devices will not be affected even if certain fog devices fail to work. In addition, security analysis and performance evaluation indicate the proposed scheme is secure and efficient.

4 July 2018 in Sensors
Verified
Journal Article
Open access
PDF file
AWAxin Wu
Axin Wu
DZDong Zheng
Dong Zheng
YZYinghui Zhang
Yinghui Zhang
MYMenglei Yang
Menglei Yang
Attribute-based encryption can be used to realize fine-grained data sharing in open networks. However, in practical applications, we have to address further challenging issues, such as attribute revocation and data search. How do data users search for the data they need in massive amounts of data? When users leave the system, they lose the right to decrypt the shared data. In this case, how do we ensure that revoked users cannot decrypt shared data? In this paper, we successfully address these issues by proposing a hidden policy attribute-based data sharing scheme with direct revocation and keyword search. In the proposed scheme, the direct revocation of attributes does not need to update the private key of non-revoked users during revocation. In addition, a keyword search is realized in our scheme, and the search time is constant with the increase in attributes. In particular, the policy is hidden in our scheme, and hence, users’ privacy is protected. Our security and performance analyses show that the proposed scheme can tackle the security and efficiency concerns in cloud computing.

28 June 2017 in Personal and Ubiquitous Computing
Verified
Journal Article
Closed access
PDF file
YZYinghui Zhang
Yinghui Zhang
JLJin Li
Jin Li
DZDong Zheng
Dong Zheng
XCXiaofeng Chen
Xiaofeng Chen
HLHui Li
Hui Li