Jianying Zhou

Prof. Jianying Zhou


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
2 May 2018 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
YZYuan Zhang
Yuan Zhang
CXChunxiang Xu
Chunxiang Xu
HLHongwei Li
Hongwei Li
KYKan Yang
Kan Yang
JZJianying Zhou
Jianying Zhou
XLXiaodong Lin
Xiaodong Lin
In this paper, we analyze the inherent characteristic of electronic medical records (EMRs) from actual electronic health (eHealth) systems, where we found that (1) multiple patients would generate large amounts of duplicate EMRs and (2) cross-patient duplicate EMRs would be generated numerously only in the case that the patients consult doctors in the same department. We then propose the first efficient and secure encrypted EMRs deduplication scheme for cloud-assisted eHealth systems (HealthDep). With the integration of our analysis results, HealthDep allows the cloud server to efficiently perform the EMRs deduplication, and enables the cloud server to reduce storage costs by more than 65% while ensuring the confidentiality of EMRs. Security analysis shows that HealthDep is more secure than the Marforio et al's scheme (NDSS 2014) and Bellare et al's scheme (USENIX Security 2013). Algorithm implementation and performance analysis demonstrate the feasibility and high efficiency of HealthDep.

28 June 2018 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
AYAnjia Yang
Anjia Yang
JXJia Xu
Jia Xu
JWJian Weng
Jian Weng
JZJianying Zhou
Jianying Zhou
DWDuncan S. Wong
Duncan S. Wong
Cloud storage has been in widespread use nowadays, which alleviates users' burden of local data storage. Meanwhile, how to ensure the security and integrity of the outsourced data stored in a cloud storage server has also attracted enormous attention from researchers. Proofs of storage (POS) is the main technique introduced to address this problem. Publicly verifiable POS allowing a third party to verify the data integrity on behalf of the data owner significantly improves the scalability of cloud service. However, most of existing publicly verifiable POS schemes are extremely slow to compute authentication tags for all data blocks due to many expensive group exponentiation operations, even much slower than typical network uploading speed, and thus it becomes the bottleneck of the setup phase of the POS scheme. In this article, we propose a new variant formulation called "Delegatable Proofs of Storage (DPOS)". Then, we construct a lightweight privacy-preserving DPOS scheme, which on one side is as efficient as private POS schemes, and on the other side can support third party auditor and can switch auditors at any time, close to the functionalities of publicly verifiable POS schemes. Compared to traditional publicly verifiable POS schemes, we speed up the tag generation process by at least several hundred times, without sacrificing efficiency in any other aspect. In addition, we extend our scheme to support fully dynamic operations with high efficiency, reducing the computation of any data update to$O(\log\;n)$and simultaneously only requiring constant communication costs. We prove that our scheme is sound and privacy preserving against auditor in the standard model. Experimental results verify the efficient performance of our scheme.

15 February 2023 in Computers & Security
Verified
Journal Article
Closed access
AWAnn Yi Wong
Ann Yi Wong
ECEyasu Getahun Chekole
Eyasu Getahun Chekole
MOMartín Ochoa
Martín Ochoa
JZJianying Zhou
Jianying Zhou

10 August 2022 in Vehicular Communications
Verified
Journal Article
Closed access
TLTrupil Limbasiya
Trupil Limbasiya
KTKo Zheng Teng
Ko Zheng Teng
SCSudipta Chattopadhyay
Sudipta Chattopadhyay
JZJianying Zhou
Jianying Zhou

31 December 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
Zheng YangZheng Yang
Zheng Yang
JHJun He
Jun He
YTYangguang Tian
Yangguang Tian
JZJianying Zhou
Jianying Zhou
Industrial Internet-of-Things (IIoT) is the basis of Industry 4.0, which extends Internet connectivity beyond traditional computing devices like computers and smartphones to the physical world for improving efficiency and accuracy while reducing the production cost. However, there are tremendous security threats to IIoT, such as IIoT device hijacking and data leaks. Therefore, a lightweight authenticated key agreement (AKA) protocol is commonly applied to establish a session key for securing the communication between IIoT devices. To protect the previous session keys from being compromised, perfect forward secrecy (PFS) has been one of the most important security properties of AKA. In this work, we present an efficient PFS-enabled AKA protocol for IIoT systems, which is developed based on a new dynamic authentication credential (DAC) framework, without using any public-key cryptographic primitives. It is worth noting that our protocol is also faster than the state-of-the-art DAC-based AKA protocols with PFS. Moreover, we give the formal security result of the proposed protocol in the random oracle model.

16 September 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SXShengmin Xu
Shengmin Xu
Jianting NingJianting Ning
Jianting Ning
XHXinyi Huang
Xinyi Huang
JZJianying Zhou
Jianying Zhou
RDRobert H. Deng
Robert H. Deng
As a versatile technique, cloud-fog computing extends the traditional cloud server to offer various on-demand data services. Maintaining data confidentiality is one of the most crucial requirements for data services, many cryptosystems have been proposed to reserve information privacy against such an untrusted environment. However, in cloud-fog computing, how to confidentially and efficiently share data and fetch desirable data without expensive data decryption for resource-constrained end-devices is challenging. In this paper, we propose a cloud-fog system for the Internet-of-Things (IoT) ecosystem by introducing a cryptographic primitive called server-aided revocable bilateral attribute-based encryption (SRB-ABE). Our solution is a secure and lightweight bilateral access control system with dynamic user groups, including (1) fine-grained data user and data owner access control simultaneously; (2) outsourced data source identification; (3) server-aided user revocation with publicly updatable ciphertexts; and (4) lightweight data decryption mechanism with one exponentiation computation. We present the formal definition and concrete construction of SRB-ABE with security proofs to build cloud-fog systems. The extensive comparison and experimental analysis demonstrate that our construction has superior functionality and comparable performance than the most relevant solutions.