FZFang Zheng

Fang Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Fang Zheng has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    More secure Outsourcing CP-ABE Scheme under the situation of untrusted PKG

    by Fang Zheng, B. Pingzhen Li, C. Xinguang Peng, Fouth D. Zhidan Li

    The scheme of CP-ABE is widely used in data security protection in cloud outsourcing service. The architecture based on CP-ABE involves user, SP, PKG and CSP. Under this situation, PKG is trusted by default. However, in the real situation, except the default situation, there exists another scenario, where there is no SP and user communicates with PKG and CSP directly. In the above environment PKG may be untrusted. Once PKG is colluded with CSP or PKG is compromised, the adversary can get the decryption keys from PKG easily and the data preserved on CSP will be decrypted and leaked. In this paper, we first innovatively propose a scheme that can resist the attack from the aforementioned situations. The idea of the scheme is that a factor generated by the user is added to the secret key and the cipher text. The secret key is added the factor, which results that even PKG is compromised or untrusted, the secret key cannot be obtained. We apply the idea on the Li's scheme and make it be suitable for the cloud outsourcing environment with an untrusted PKG. Finally, we prove the security of our scheme.

  • Open Access

    More Secure Outsourcing CP-ABE Scheme Under the Situation of Untrusted PKG

    by Fang Zheng, Pingzhen Li, Xinguang Peng, Zhidan Li

    The scheme of CP-ABE is widely used in data security protection in cloud outsourcing service. The architecture based on CP-ABE involves user, SP, PKG and CSP. Under this situation, PKG is trusted by default. However, in the real situation, except the default situation, there exists another scenario, where there is no SP and user communicates with PKG and CSP directly. In the above environment PKG may be untrusted. Once PKG is colluded with CSP or PKG is compromised, the adversary can get the decryption keys from PKG easily and the data preserved on CSP will be decrypted and leaked. In this paper, we first innovatively propose a scheme that can resist the attack from the aforementioned situations. The idea of the scheme is that a factor generated by the user is added to the secret key and the cipher text. The secret key is added the factor, which results that even PKG is compromised or untrusted, the secret key cannot be obtained. We apply the idea on the Li’s scheme and make it be suitable for the cloud outsourcing environment with an untrusted PKG. Finally, we prove the security of our scheme.


  • Open Access

    Identification of Unique Genetic Biomarkers of Various Subtypes of Glomerulonephritis Using Machine Learning and Deep Learning

    by Jianbo Qing, Fang Zheng, Huiwen Zhi, Hasnaa Yaigoub, Hasna Tirichen, Yaheng Li, Juanjuan Zhao, Yan Qiang, Yafeng Li

    (1) Objective: Identification of potential genetic biomarkers for various glomerulonephritis (GN) subtypes and discovering the molecular mechanisms of GN. (2) Methods: four microarray datasets of GN were downloaded from Gene Expression Omnibus (GEO) database and merged to obtain the gene expression profiles of eight GN subtypes. Then, differentially expressed immune-related genes (DIRGs) were identified to explore the molecular mechanisms of GN, and single-sample gene set enrichment analysis (ssGSEA) was performed to discover the abnormal inflammation in GN. In addition, a nomogram model was generated using the R package “glmnet”, and the calibration curve was plotted to evaluate the predictive power of the nomogram model. Finally, deep learning (DL) based on a multilayer perceptron (MLP) network was performed to explore the characteristic genes for GN. (3) Results: we screened out 274 common up-regulated or down-regulated DIRGs in the glomeruli and tubulointerstitium. These DIRGs are mainly involved in T-cell differentiation, the RAS signaling pathway, and the MAPK signaling pathway. ssGSEA indicates that there is a significant increase in DC (dendritic cells) and macrophages, and a significant decrease in neutrophils and NKT cells in glomeruli, while monocytes and NK cells are increased in tubulointerstitium. A nomogram model was constructed to predict GN based on 7 DIRGs, and 20 DIRGs of each subtype of GN in glomeruli and tubulointerstitium were selected as characteristic genes. (4) Conclusions: this study reveals that the DIRGs are closely related to the pathogenesis of GN and could serve as genetic biomarkers in GN. DL further identified the characteristic genes that are essential to define the pathogenesis of GN and develop targeted therapies for eight GN subtypes.


  • Open Access

    An Efficient User’s Attribute Revocation Scheme Suitable for Data Outsourcing in Cloud Storage

    by Fang Zheng, Xinguang Peng, Zhidan Li

    With the advances of cloud data centers and cloud service, many application scenarios are developed such as enterprise business, the Vehicular Ad Hoc Networks (VANET), Sensor network. Confidentiality and efficiency are two key problems. CP-ABE is one of fine-grained access control cryptographic technologies and it is widely applied in outsourced data in cloud storage to protect the user’s privacy. In addition, besides confidentiality, computational cost is an important factor which makes the application of CP-ABE possible in the situations. In this paper, we propose a novel and fast scheme based on CP-ABE algorithm from the respect of the user’s attribute revocation to make it faster. In this scheme, we construct an identical tree T2 that has the same structure as the actual access control tree T1. When the user issues to request the encrypted text preserved on CSP, CSP first tries to decrypt CT2 which is encrypted according to the access policy based on the identical tree T2 and also preserved on it, with the subset of the secret keys corresponding to the indexes of the attributes provided by the user. If CSP can successfully decrypt it, it proves that he/she has the authorization to access the cryptographic text CT1 and CSP will send CT1 to the user. Otherwise, CSP recognizes that the user has no access to CT1 and rejects to send CT1 to the user. Namely, we can decide if we authorize the right to access CT1 by judging if the secret key provided by the user can decrypt CT2. Because CT1 and CT2 have the same access control structure, they have the same secret key for decryption; that is, when some attributes are revoked, if the secret key cannot decrypt CT2, it cannot decrypt CT1. While CSP can directly decrypt CT2, but not CT1, CSP can judge if the user has access to CT1 after the attribute revocation by decryption of CT2. Moreover, we propose the construction method of CT1 and CT2. Finally, we prove that the scheme is secure and viable.


  • Open Access

    The scheme of personal privacy protection based on data separation in Mobile identity authentication

    by Fang Zheng, Pingzhen Li, Jianqin Wei

    To avoid privacy leaked in mobile identity authentication by telephone number, this paper proposes a scheme of data separation that separates telephone number from server of service provider and stores it on trusted third-party server. In the process, we put forward some ideas to solve the problems brought by this scheme, which includes a table introduced to associate real identity and network one, a way of access authorization. Finally, we analyze the performance of the scheme and discuss the time efficiency by experiment.

  • Open Access

    One More Accuracy k-Anonymity Framework for LBS

    by Fang Zheng, Xinguang Peng, Pingzhen Li

    To achieve privacy protection in the k-anonymity algorithm, replacing the starting positions of k users with the center of the cloaked area results in the route from the starting position to the center of the cloaked area probably nonlinear, which will bring out the inconvenience for the user. This paper proposes a new anonymous server framework, on which we add the function of electronic map and navigation compared to the original one based on the framework of k-anonymity for LBS. In addition to the original tasks including computing the center of cloaked area O and the actual query result ri corresponding to the query qi, the anonymous server with the new architecture will plan the actual path loi−O from the starting query location oi to the center of the cloaked area O and return the new result collection of ri,rO−si for the user ui. Moreover, this paper improves the algorithm of computing the route rO−si to make it more in line with the actual situation of road network operation. Finally, we prove the importance of the approach by the experiment demonstration.