Cong Li
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
Research Subjects
Research Interests
Cong Li has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Zhonghai Wu
School of Software and Microelectronics, Peking University, Beijing, China
7 shared publications - Qingni Shen
Peking University
6 shared publications Qingni Shen
Peking University
3 shared publications- Xinyu Feng
Zhonghe Tech (Xiongan) Co., Ltd., Xiongan, China
3 shared publications - Wu Xin
Peking University
2 shared publications - Yahui Zhao
China Unicom Software Research Institute
2 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature
- p. 15-31
DAPU: Dynamic Attribute and Policy Updating Attribute-Based Access Control for Cloud Data Sharing
- 26 September 2026
- Published by Springer Nature
- p. 15-31
DAPU: Dynamic Attribute and Policy Updating Attribute-Based Access Control for Cloud Data Sharing
- 26 September 2026
- Published by Springer Nature
- p. 572-588
Efficient Revocable Identity-Based Inner Product Functional Encryption Based on SM9
- 26 September 2026
- Published by Springer Nature
- p. 572-588
Efficient Revocable Identity-Based Inner Product Functional Encryption Based on SM9
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PLONK-Hammer:Breaking Input Privacy of PLONK Proving Systems via Rowhammer
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPLONK-Hammer:Breaking Input Privacy of PLONK Proving Systems via Rowhammer
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 2 January 2026
- Published by Springer Nature
- p. 248-268
Wildcarded Identity-Based Inner Product Encryption Based on SM9
- 2 January 2026
- Published by Springer Nature
- p. 248-268
Wildcarded Identity-Based Inner Product Encryption Based on SM9
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 166-170
PDP-FedKD: Personalized Differential Privacy With Adaptive Budget Selection in Heterogeneous Federated Learning
Federated learning (FL) faces challenges in ensuring personalized model performance while maintaining strong privacy protection. Combined with knowledge distillation, federated learning enhanced by differential privacy has garnered increased attention. However, existing privacy-preserving federated distillation methods often apply a uniform privacy budget, neglecting the varying privacy needs across heterogeneous clients. In this letter, we propose PDP-FedKD, a Personalized Differential Privacy-based Federated Knowledge Distillation approach. PDP-FedKD allows clients to self-select their privacy budgets using a nonuniform sampling strategy and introduces tailored noise into distillation models across heterogeneous clients. Our approach ensures global model generalization and local model personalization while preserving the global privacy budget. We further analyze tight privacy accounting based on Rényi differential privacy to optimize the trade-off between privacy and model accuracy. Experimental results in non-IID settings show that PDP-FedKD improves model performance by 4.06% over LDP-FedAKD with a uniform privacy budget and by 7.73% over DP-FedAvg without optimizing heterogeneity.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 166-170
PDP-FedKD: Personalized Differential Privacy With Adaptive Budget Selection in Heterogeneous Federated Learning
Federated learning (FL) faces challenges in ensuring personalized model performance while maintaining strong privacy protection. Combined with knowledge distillation, federated learning enhanced by differential privacy has garnered increased attention. However, existing privacy-preserving federated distillation methods often apply a uniform privacy budget, neglecting the varying privacy needs across heterogeneous clients. In this letter, we propose PDP-FedKD, a Personalized Differential Privacy-based Federated Knowledge Distillation approach. PDP-FedKD allows clients to self-select their privacy budgets using a nonuniform sampling strategy and introduces tailored noise into distillation models across heterogeneous clients. Our approach ensures global model generalization and local model personalization while preserving the global privacy budget. We further analyze tight privacy accounting based on Rényi differential privacy to optimize the trade-off between privacy and model accuracy. Experimental results in non-IID settings show that PDP-FedKD improves model performance by 4.06% over LDP-FedAKD with a uniform privacy budget and by 7.73% over DP-FedAvg without optimizing heterogeneity.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3849-3861
Identity-Based Chameleon Hashes in the Standard Model for Mobile Devices
Online/offline identity-based signature (OO-IBS) is a versatile cryptographic tool to provide the message authentication and integrity in mobile devices, since it lightens the computational burden after the signer receiving the message and eliminates the overhead of certificate management. It has several valuable applications, for instance, wireless sensor networks. Identity-based chameleon hash (IB-CH), as an alternative building block to construct OO-IBS, has been explored in numerous literatures. Nevertheless, there still exist two major issues. (1) Nearly all of the previous IB-CH schemes with weak collision-resistance (W-CollRes) are with random oracles, which may lead to security risks in practicality. The only IB-CH scheme in the standard model suffers from the large size of public parameters and inefficient setup process. (2) The only IB-CH scheme without key exposure also relies on random oracles. In this paper, we propose two novel IB-CH schemes in the standard model. The first scheme is adaptive identity, W-CollRes secure and efficient, significantly reducing the computation costs of all algorithms and the size of public parameters compared with the existing scheme in the standard model. The second scheme is the first IB-CH achieving key exposure freeness without random oracles. Both theoretical and experimental analyses demonstrate the good performance of our proposed schemes. Furthermore, we apply our schemes to optimizing the existing generic OO-IBS construction. The optimized generic constructions reduce computational overhead by 50.0% in the online phase and enable the hash value/signature tuple generated in the offline phase to be reusable, respectively.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3849-3861
Identity-Based Chameleon Hashes in the Standard Model for Mobile Devices
Online/offline identity-based signature (OO-IBS) is a versatile cryptographic tool to provide the message authentication and integrity in mobile devices, since it lightens the computational burden after the signer receiving the message and eliminates the overhead of certificate management. It has several valuable applications, for instance, wireless sensor networks. Identity-based chameleon hash (IB-CH), as an alternative building block to construct OO-IBS, has been explored in numerous literatures. Nevertheless, there still exist two major issues. (1) Nearly all of the previous IB-CH schemes with weak collision-resistance (W-CollRes) are with random oracles, which may lead to security risks in practicality. The only IB-CH scheme in the standard model suffers from the large size of public parameters and inefficient setup process. (2) The only IB-CH scheme without key exposure also relies on random oracles. In this paper, we propose two novel IB-CH schemes in the standard model. The first scheme is adaptive identity, W-CollRes secure and efficient, significantly reducing the computation costs of all algorithms and the size of public parameters compared with the existing scheme in the standard model. The second scheme is the first IB-CH achieving key exposure freeness without random oracles. Both theoretical and experimental analyses demonstrate the good performance of our proposed schemes. Furthermore, we apply our schemes to optimizing the existing generic OO-IBS construction. The optimized generic constructions reduce computational overhead by 50.0% in the online phase and enable the hash value/signature tuple generated in the offline phase to be reusable, respectively.
- 21 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (6) , 1911-1920
Redactable Blockchain From Decentralized Chameleon Hash Functions, Revisited
Recently, redactable blockchains have attracted attention owing to enabling the contents of blocks to be re-written. The existing redactable blockchain solutions can be classified as two categories, the centralized one and decentralized one. In centralized solutions, a single blockchain node possessing the trapdoor conducts redaction operations. However, they suffer from the issue of single point of failure. In decentralized solutions, redaction operations are performed by numerous blockchain nodes cooperatively. But there also exists the issue of inefficiency or requiring a trusted party in these solutions. Subsequently, Jia et al. proposed a redactable blockchain solution from a decentralized chameleon hash function (DCH) they designed, which supports the threshold redaction, traceability and consistency check. Nevertheless, after carefully analyzing their solution, we find that it fails to achieve the security they claimed by presenting a concrete attack. To resolve this security issue, we propose a novel chameleon hash function scheme that achieves strong collision-resistant security while maintaining simple and efficient as the building block. Based on it, we then present an improved DCH scheme with sufficient security, so that the redactable blockchain from it can resist the presented attack. Theoretical and experimental analyses demonstrate that improved DCH achieves efficiency comparable to DCH.
- 21 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (6) , 1911-1920
Redactable Blockchain From Decentralized Chameleon Hash Functions, Revisited
Recently, redactable blockchains have attracted attention owing to enabling the contents of blocks to be re-written. The existing redactable blockchain solutions can be classified as two categories, the centralized one and decentralized one. In centralized solutions, a single blockchain node possessing the trapdoor conducts redaction operations. However, they suffer from the issue of single point of failure. In decentralized solutions, redaction operations are performed by numerous blockchain nodes cooperatively. But there also exists the issue of inefficiency or requiring a trusted party in these solutions. Subsequently, Jia et al. proposed a redactable blockchain solution from a decentralized chameleon hash function (DCH) they designed, which supports the threshold redaction, traceability and consistency check. Nevertheless, after carefully analyzing their solution, we find that it fails to achieve the security they claimed by presenting a concrete attack. To resolve this security issue, we propose a novel chameleon hash function scheme that achieves strong collision-resistant security while maintaining simple and efficient as the building block. Based on it, we then present an improved DCH scheme with sufficient security, so that the redactable blockchain from it can resist the presented attack. Theoretical and experimental analyses demonstrate that improved DCH achieves efficiency comparable to DCH.
- 3 October 2024
- Published by Springer Nature
- p. 534-545
MH-pFLGB: Model Heterogeneous Personalized Federated Learning via Global Bypass for Medical Image Analysis
- 3 October 2024
- Published by Springer Nature
- p. 534-545
MH-pFLGB: Model Heterogeneous Personalized Federated Learning via Global Bypass for Medical Image Analysis
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 4306-4308
On the Security of Secure Keyword Search and Data Sharing Mechanism for Cloud Computing
Nearly all of the previous attribute-based proxy re-encryption (ABPRE) schemes cannot support keyword search and keyword updating without the aid of private key generator (PKG) simultaneously. To resolve this problem, recently in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2020.2963978), Ge et al. proposed a ciphertext-policy ABPRE scheme with keyword search, dubbed CPAB-KSDS, which supports keyword updating without communicating with PKG. It also achieves indistinguishability against chosen-ciphertext attack (IND-CCA) security and indistinguishability against chosen-keyword attack (INDCKA) security in the random oracle model. In this paper, we carefully analyze the security of Ge et al.’s CPAB-KSDS scheme and find that they did not give a correct reduction from IND-CKA security of theirs to the underlying cryptographic assumption. Furthermore, we also give a concrete attack on IND-CKA security of the CPAB-KSDS scheme. Therefore, it fails to achieve IND-CKA security they claimed, which is an essential security requirement for the encryption scheme with keyword search.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 4306-4308
On the Security of Secure Keyword Search and Data Sharing Mechanism for Cloud Computing
Nearly all of the previous attribute-based proxy re-encryption (ABPRE) schemes cannot support keyword search and keyword updating without the aid of private key generator (PKG) simultaneously. To resolve this problem, recently in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2020.2963978), Ge et al. proposed a ciphertext-policy ABPRE scheme with keyword search, dubbed CPAB-KSDS, which supports keyword updating without communicating with PKG. It also achieves indistinguishability against chosen-ciphertext attack (IND-CCA) security and indistinguishability against chosen-keyword attack (INDCKA) security in the random oracle model. In this paper, we carefully analyze the security of Ge et al.’s CPAB-KSDS scheme and find that they did not give a correct reduction from IND-CKA security of theirs to the underlying cryptographic assumption. Furthermore, we also give a concrete attack on IND-CKA security of the CPAB-KSDS scheme. Therefore, it fails to achieve IND-CKA security they claimed, which is an essential security requirement for the encryption scheme with keyword search.