Li Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Li Duan has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Yong Li
Huawei Technologies Düsseldorf
13 shared publications - Lijun Liao
Huawei Technologies Düsseldorf
4 shared publications - Yulian Sun
Huawei Technologies Düsseldorf
4 shared publications - Asja Fischer
Ruhr University Bochum
1 shared publication - Bart Preneel
KU Leuven
1 shared publication - Changsong Jiang
University of Electronic Science and Technology of China
1 shared publication
Latest Publications
- 8 October 2026
- Published by Springer Nature
- p. 44-62
0-RTT Integrated in SPDM for Large-Scale AI Super-Clusters
- 8 October 2026
- Published by Springer Nature
- p. 44-62
0-RTT Integrated in SPDM for Large-Scale AI Super-Clusters
- 7 July 2025
- Published by Springer Nature
- p. 22-41
Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption
- 7 July 2025
- Published by Springer Nature
- p. 22-41
Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption
- 20 June 2025
- Published by Springer Nature
- p. 391-414
Obfuscation for Deep Neural Networks Against Model Extraction: Attack Taxonomy and Defense Optimization
- 20 June 2025
- Published by Springer Nature
- p. 391-414
Obfuscation for Deep Neural Networks Against Model Extraction: Attack Taxonomy and Defense Optimization
- 3 May 2025
- Published by Springer Nature
- p. 173-192
Privacy-Preserving Certificate-Less Authenticated Key Exchange with Key Registration Privacy
- 3 May 2025
- Published by Springer Nature
- p. 173-192
Privacy-Preserving Certificate-Less Authenticated Key Exchange with Key Registration Privacy
- 1 April 2025
- Published by Springer Nature
- p. 29-38
Short Paper: PSY: Posterior Sampling Based Privacy Enhancer in Large Language Models
- 1 April 2025
- Published by Springer Nature
- p. 29-38
Short Paper: PSY: Posterior Sampling Based Privacy Enhancer in Large Language Models
- Open Access
PSY: Posterior Sampling Based Privacy Enhancer in Large Language Models
Privacy vulnerabilities in LLMs, such as leakage from memorization, have been constantly identified, and various mitigation proposals have been proposed. LoRA is usually used in fine-tuning LLMs and a good entry point to insert privacy-enhancing modules. In this ongoing research, we introduce PSY, a Posterior Sampling based PrivacY enhancer that can be used in LoRA. We propose a simple yet effective realization of PSY using posterior sampling, which effectively prevents privacy leakage from intermediate information and, in turn, preserves the privacy of data owners. We evaluate LoRA extended with PSY against state-of-the-art membership inference and data extraction attacks. The experiments are executed on three different LLM architectures fine-tuned on three datasets with LoRA. In contrast to the commonly used differential privacy method, we find that our proposed modification consistently reduces the attack success rate. Meanwhile, our method has almost no negative impact on model fine-tuning or final performance. Most importantly, PSY reveals a promising path toward privacy enhancement with latent space extensions.
Open AccessPSY: Posterior Sampling Based Privacy Enhancer in Large Language Models
Privacy vulnerabilities in LLMs, such as leakage from memorization, have been constantly identified, and various mitigation proposals have been proposed. LoRA is usually used in fine-tuning LLMs and a good entry point to insert privacy-enhancing modules. In this ongoing research, we introduce PSY, a Posterior Sampling based PrivacY enhancer that can be used in LoRA. We propose a simple yet effective realization of PSY using posterior sampling, which effectively prevents privacy leakage from intermediate information and, in turn, preserves the privacy of data owners. We evaluate LoRA extended with PSY against state-of-the-art membership inference and data extraction attacks. The experiments are executed on three different LLM architectures fine-tuned on three datasets with LoRA. In contrast to the commonly used differential privacy method, we find that our proposed modification consistently reduces the attack success rate. Meanwhile, our method has almost no negative impact on model fine-tuning or final performance. Most importantly, PSY reveals a promising path toward privacy enhancement with latent space extensions.
- 6 September 2024
- Published by Springer Nature
- p. 390-409
Exploiting Internal Randomness for Privacy in Vertical Federated Learning
- 6 September 2024
- Published by Springer Nature
- p. 390-409
Exploiting Internal Randomness for Privacy in Vertical Federated Learning
- Open Access
- 14 December 2023
- Published by MDPI AG in Cryptography
- Vol. 7 (4) , 63
Practical Certificate-Less Infrastructure with Application in TLS
We propose highly efficient certificate-less (CL) protocols for the infrastructure used by authenticated key exchange (AKE). The construction is based on elliptic curves (EC) without pairing, which means it can be easily supported by most industrial cryptography libraries on constrained devices. Compared with other pairing-free CL solutions, the new CL-AKE protocol enjoys the least number of scalar multiplications over EC groups. We use a unified game-based model to formalize the security of each protocol, while most previous works only assess the security against a list of attacks, provide informal theorems without proper modeling, or use separate models for protocols in different stages. We also present an efficient integration of the core protocols into the TLS cipher suites and a stand-alone implementation for constrained devices. The performance is evaluated on constrained devices in real-world settings, which further confirms the efficiency of our proposal.
- 14 December 2023
- Published by MDPI AG in Cryptography
- Vol. 7 (4) , 63
Open AccessPractical Certificate-Less Infrastructure with Application in TLS
We propose highly efficient certificate-less (CL) protocols for the infrastructure used by authenticated key exchange (AKE). The construction is based on elliptic curves (EC) without pairing, which means it can be easily supported by most industrial cryptography libraries on constrained devices. Compared with other pairing-free CL solutions, the new CL-AKE protocol enjoys the least number of scalar multiplications over EC groups. We use a unified game-based model to formalize the security of each protocol, while most previous works only assess the security against a list of attacks, provide informal theorems without proper modeling, or use separate models for protocols in different stages. We also present an efficient integration of the core protocols into the TLS cipher suites and a stand-alone implementation for constrained devices. The performance is evaluated on constrained devices in real-world settings, which further confirms the efficiency of our proposal.
- 1 December 2023
- Published by Springer Nature
- p. 415-434
Efficient Forward Secrecy for TLS-PSK from Pure Symmetric Cryptography
- 1 December 2023
- Published by Springer Nature
- p. 415-434
Efficient Forward Secrecy for TLS-PSK from Pure Symmetric Cryptography
- 1 December 2023
- Published by Springer Nature
- p. 435-454
On the Privacy-Preserving Infrastructure for Authenticated Key Exchange
- 1 December 2023
- Published by Springer Nature
- p. 435-454
On the Privacy-Preserving Infrastructure for Authenticated Key Exchange