Hui Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hui Guo has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Xiao Lan
Sichuan University
3 shared publications - Hongjian Jin
College of Cyber Science and Engineering, Sichuan University, Chengdu, China
2 shared publications - Hongxia Zhang
School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, China
1 shared publication - Jing Xu
Chinese Academy of Sciences
1 shared publication - Ningyu An
State Grid Corporation Joint Laboratory of Artificial Intelligence on Electric Power System, Global Energy Interconnection Research Institute, Beijng, Beijng China
1 shared publication - Qi Cao
School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, China
1 shared publication
Latest Publications
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 3058-3073
Efficient and Secure Quantile Aggregation of Private Data Streams
Computing the quantile of a massive data stream has been a crucial task in networking and data management. However, existing solutions assume a centralized model where one data owner has access to all data. In this paper, we put forward a study of secure quantile aggregation between private data streams, where data streams owned by different parties would like to obtain a quantile of the union of their data without revealing anything else about their inputs. To this end, we designed efficient cryptographic protocols that are secure in the semi-honest setting as well as the malicious setting. By incorporating differential privacy, we further improve the efficiency by 1.1× to 73.1×. We implemented our protocol, which shows practical efficiency to aggregate real-world data streams efficiently.
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 3058-3073
Efficient and Secure Quantile Aggregation of Private Data Streams
Computing the quantile of a massive data stream has been a crucial task in networking and data management. However, existing solutions assume a centralized model where one data owner has access to all data. In this paper, we put forward a study of secure quantile aggregation between private data streams, where data streams owned by different parties would like to obtain a quantile of the union of their data without revealing anything else about their inputs. To this end, we designed efficient cryptographic protocols that are secure in the semi-honest setting as well as the malicious setting. By incorporating differential privacy, we further improve the efficiency by 1.1× to 73.1×. We implemented our protocol, which shows practical efficiency to aggregate real-world data streams efficiently.
- Open Access
- 17 July 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1
Corrigendum to “BNRDT: When Data Transmission Meets Blockchain”
In the article titled “BNRDT: When Data Transmission Meets Blockchain” [1], the acknowledgments section should be corrected as follows:
- 17 July 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1
Open AccessCorrigendum to “BNRDT: When Data Transmission Meets Blockchain”
In the article titled “BNRDT: When Data Transmission Meets Blockchain” [1], the acknowledgments section should be corrected as follows:
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 18 (1) , 145-159
Accountable Proxy Re-Encryption for Secure Data Sharing
Proxy re-encryption (PRE) provides a promising solution for encrypted data sharing in public cloud. When data owner Alice is going to share her encrypted data with data consumer Bob, Alice generates a re-encryption key and sends it to the cloud server (proxy); by using it, the proxy can transform Alice's ciphertexts into Bob's without learning anything about the underlying plaintexts. Despite that existing PRE schemes can prevent the proxy from recovering Alice's secret key by collusion attacks with Bob, due to the inherent functionality of PRE, it is inevitable that the proxy and Bob together are capable to gain and distribute Alice's decryption capabilities. Even worse, the malicious proxy can deny that it has leaked the decryption capabilities and has very little risk of getting caught. To tackle this problem, we introduce the concept of Accountable Proxy Re-Encryption (APRE), whereby if the proxy is accused to abuse the re-encryption key for distributing Alice's decryption capability, a tracing algorithm can decide whether it is innocent or not. We then present a non-interactive APRE scheme and prove its CPA security and accountability under DBDH assumption in the standard model. Finally, we show how to extend it to a CCA secure one.
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 18 (1) , 145-159
Accountable Proxy Re-Encryption for Secure Data Sharing
Proxy re-encryption (PRE) provides a promising solution for encrypted data sharing in public cloud. When data owner Alice is going to share her encrypted data with data consumer Bob, Alice generates a re-encryption key and sends it to the cloud server (proxy); by using it, the proxy can transform Alice's ciphertexts into Bob's without learning anything about the underlying plaintexts. Despite that existing PRE schemes can prevent the proxy from recovering Alice's secret key by collusion attacks with Bob, due to the inherent functionality of PRE, it is inevitable that the proxy and Bob together are capable to gain and distribute Alice's decryption capabilities. Even worse, the malicious proxy can deny that it has leaked the decryption capabilities and has very little risk of getting caught. To tackle this problem, we introduce the concept of Accountable Proxy Re-Encryption (APRE), whereby if the proxy is accused to abuse the re-encryption key for distributing Alice's decryption capability, a tracing algorithm can decide whether it is innocent or not. We then present a non-interactive APRE scheme and prove its CPA security and accountability under DBDH assumption in the standard model. Finally, we show how to extend it to a CCA secure one.