Hao Zhang
Research Subjects
Hao Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Hu Xiong
University of Electronic Science and Technology of China
2 shared publications - Jianfei Sun
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Jintao Meng
National Key Laboratory of Security Communication, Chengdu, China
1 shared publication - Lili Wang
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Xin Huang
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Xue Wang
Science and Technology on Communication Security Laboratory, Chengdu 610041, China
1 shared publication
Latest Publications
- Open Access
Data Mining to Atmospheric Corrosion Process Based on Evidence Fusion
An electrical resistance sensor-based atmospheric corrosion monitor was employed to study the carbon steel corrosion in outdoor atmospheric environments by recording dynamic corrosion data in real-time. Data mining of collected data contributes to uncovering the underlying mechanism of atmospheric corrosion. In this study, it was found that most statistical correlation coefficients do not adapt to outdoor coupled corrosion data. In order to deal with online coupled data, a new machine learning model is proposed from the viewpoint of information fusion. It aims to quantify the contribution of different environmental factors to atmospheric corrosion in different exposure periods. Compared to the commonly used machine learning models of artificial neural networks and support vector machines in the corrosion research field, the experimental results demonstrated the efficiency and superiority of the proposed model on online corrosion data in terms of measuring the importance of atmospheric factors and corrosion prediction accuracy.
Open AccessData Mining to Atmospheric Corrosion Process Based on Evidence Fusion
An electrical resistance sensor-based atmospheric corrosion monitor was employed to study the carbon steel corrosion in outdoor atmospheric environments by recording dynamic corrosion data in real-time. Data mining of collected data contributes to uncovering the underlying mechanism of atmospheric corrosion. In this study, it was found that most statistical correlation coefficients do not adapt to outdoor coupled corrosion data. In order to deal with online coupled data, a new machine learning model is proposed from the viewpoint of information fusion. It aims to quantify the contribution of different environmental factors to atmospheric corrosion in different exposure periods. Compared to the commonly used machine learning models of artificial neural networks and support vector machines in the corrosion research field, the experimental results demonstrated the efficiency and superiority of the proposed model on online corrosion data in terms of measuring the importance of atmospheric factors and corrosion prediction accuracy.
- 15 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 4118-4129
An Anonymous Authentication Protocol With Delegation and Revocation for Content Delivery Networks
By redirecting a user’s request to the nearest cache server, content delivery networks (CDNs) enable users to obtain services in time and reduce the burden of the origin server. Nevertheless, the origin server suffers from the private key leakage problem when delegating the authentication capability to untrusted CDN nodes. To handle this challenge, this article proposes an anonymous authentication protocol with delegation and revocation for CDNs depending on the proxy resignature (PRS) cryptography. Specifically, we first present an efficient revocable PRS (R-PRS) scheme, which is proved to be secure under the extended Computational Diffie-Hellman assumption. Then, based on R-PRS scheme, the proposed protocol enables the origin server to delegate and revoke the authentication capability to the CDN nodes without leaking its private key. Furthermore, our protocol not only provides anonymity, mutual authentication, and session key establishment, but also achieves forward security. Eventually, theoretical analysis and implementation demonstrate that the proposed protocol has an excellent performance in efficiency and practicality.
- 15 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 4118-4129
An Anonymous Authentication Protocol With Delegation and Revocation for Content Delivery Networks
By redirecting a user’s request to the nearest cache server, content delivery networks (CDNs) enable users to obtain services in time and reduce the burden of the origin server. Nevertheless, the origin server suffers from the private key leakage problem when delegating the authentication capability to untrusted CDN nodes. To handle this challenge, this article proposes an anonymous authentication protocol with delegation and revocation for CDNs depending on the proxy resignature (PRS) cryptography. Specifically, we first present an efficient revocable PRS (R-PRS) scheme, which is proved to be secure under the extended Computational Diffie-Hellman assumption. Then, based on R-PRS scheme, the proposed protocol enables the origin server to delegate and revoke the authentication capability to the CDN nodes without leaking its private key. Furthermore, our protocol not only provides anonymity, mutual authentication, and session key establishment, but also achieves forward security. Eventually, theoretical analysis and implementation demonstrate that the proposed protocol has an excellent performance in efficiency and practicality.
- 3 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 13 (3) , 2739-2750
Attribute-Based Privacy-Preserving Data Sharing for Dynamic Groups in Cloud Computing
The sharing of personal data with multiple users from different domains has been benefited considerably from the rapid advances of cloud computing, and it is highly desirable to ensure the sharing file should not be exposed to the unauthorized users or cloud providers. Unfortunately, issues such as achieving the flexible access control of the sharing file, preserving the privacy of the receivers, forming the receiver groups dynamically, and high efficiency in encryption/decryption still remain challenging. To deal with these challenges, we provide a novel anonymous attribute-based broadcast encryption (A $^{2}$ B $^{2}$ E) which features the property of hidden access policy and enables the data owner to share his/her data with multiple participants who are inside a predefined receiver set and fulfill the access policy. We first suggest a concrete A $^{2}$ B $^{2}$ E scheme together with the rigorous and formal security proof without the support of the random oracle model. Then, we design an efficient and secure data sharing system by incorporating the A $^{2}$ B $^{2}$ E scheme, verifiable outsourcing decryption technique for attribute-based encryption, and the idea of online/offline attribute-based encryption. Extensive security analysis and performance evaluation demonstrate that our data sharing system is secure and practical.- 3 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 13 (3) , 2739-2750
Attribute-Based Privacy-Preserving Data Sharing for Dynamic Groups in Cloud Computing
The sharing of personal data with multiple users from different domains has been benefited considerably from the rapid advances of cloud computing, and it is highly desirable to ensure the sharing file should not be exposed to the unauthorized users or cloud providers. Unfortunately, issues such as achieving the flexible access control of the sharing file, preserving the privacy of the receivers, forming the receiver groups dynamically, and high efficiency in encryption/decryption still remain challenging. To deal with these challenges, we provide a novel anonymous attribute-based broadcast encryption (A $^{2}$ B $^{2}$ E) which features the property of hidden access policy and enables the data owner to share his/her data with multiple participants who are inside a predefined receiver set and fulfill the access policy. We first suggest a concrete A $^{2}$ B $^{2}$ E scheme together with the rigorous and formal security proof without the support of the random oracle model. Then, we design an efficient and secure data sharing system by incorporating the A $^{2}$ B $^{2}$ E scheme, verifiable outsourcing decryption technique for attribute-based encryption, and the idea of online/offline attribute-based encryption. Extensive security analysis and performance evaluation demonstrate that our data sharing system is secure and practical.