Zhou Li

Orcid: 0000-0003-4070-3985

Affiliations:
  • University of North Texas, Denton, TY, USA


According to our database1, Zhou Li authored at least 23 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
An IR-HARQ Scheme for Shortening Polar Codes Using Layered Decoding.
IEEE Trans. Veh. Technol., May, 2026

Information-Theoretic Decentralized Secure Aggregation with User Dropouts.
CoRR, May, 2026

Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys.
CoRR, May, 2026

Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints.
CoRR, April, 2026

On the Fundamental Limits of Hierarchical Secure Aggregation with Dropout and Collusion Resilience.
CoRR, March, 2026

Information-Theoretic Secure Aggregation over Regular Graphs.
CoRR, January, 2026

Information-Theoretic Secure Aggregation in Decentralized Networks.
CoRR, January, 2026

Optimal Rate Region for Multi-server Secure Aggregation with User Collusion.
CoRR, January, 2026

Information-Theoretic Decentralized Secure Aggregation With Passive Collusion Resilience.
IEEE J. Sel. Areas Commun., 2026

On the Communication-Key Rate Region of Hierarchical Vector Linear Secure Aggregation.
Entropy, 2026

2025
Optimal Key Rates for Decentralized Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints.
CoRR, December, 2025

The Capacity of Collusion-Resilient Decentralized Secure Aggregation with Groupwise Keys.
CoRR, November, 2025

Graph-Theoretic Characterization of Noise Capacity of Conditional Disclosure of Secrets.
CoRR, October, 2025

Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience.
CoRR, August, 2025

Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association.
CoRR, March, 2025

Collusion-Resilient Hierarchical Secure Aggregation with Heterogeneous Security Constraints.
Proceedings of the IEEE Information Theory Workshop, 2025

Communication-Efficient Hierarchical Secure Aggregation with Cyclic User Association.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Noise Capacity of Conditional Disclosure of Secrets: A Graph-Theoretic Perspective.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2023
On Extremal Rates of Secure Storage Over Graphs.
IEEE Trans. Inf. Forensics Secur., 2023

Weakly Secure Summation with Colluding Users.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On Extremal Rates of Storage over Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2021
On the Linear Capacity of Conditional Disclosure of Secrets.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach.
Proceedings of the IEEE International Symposium on Information Theory, 2020


  Loading...