Hua Sun

Orcid: 0000-0001-8777-7987

Affiliations:
  • University of North Texas, Department of Electrical Engineering, Denton, TX, USA
  • University of California at Irvine, Center of Pervasive Communications and Computing, USA


According to our database1, Hua Sun authored at least 98 papers between 2012 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On Secure Aggregation With Uncoded Groupwise Keys Against User Dropouts and User Collusion.
IEEE Trans. Inf. Theory, November, 2025

On the Capacity of Erasure-prone Quantum Storage with Erasure-prone Entanglement Assistance.
CoRR, October, 2025

On the Capacity of Distributed Quantum Storage.
CoRR, October, 2025

Fundamental Limits of Multi-Message Private Computation.
IEEE Trans. Commun., September, 2025

MDS Variable Generation and Secure Summation With User Selection.
IEEE Trans. Inf. Theory, April, 2025

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

Secure Groupcast: Extra-Entropic Structure and Linear Feasibility.
IEEE Trans. Inf. Theory, January, 2025

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

2024
The Capacity Region of Information Theoretic Secure Aggregation With Uncoded Groupwise Keys.
IEEE Trans. Inf. Theory, October, 2024

On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys.
IEEE Trans. Inf. Theory, September, 2024

Secure Summation: Capacity Region, Groupwise Key, and Feasibility.
IEEE Trans. Inf. Theory, February, 2024

Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation with User Collusion.
CoRR, 2024

Secure Summation with User Selection and Collusion.
Proceedings of the IEEE Information Theory Workshop, 2024

Optimal Rate Region for Key Efficient Hierarchical Secure Aggregation with User Collusion.
Proceedings of the IEEE Information Theory Workshop, 2024

On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.
Proceedings of the IEEE International Symposium on Information Theory, 2024

On Multi-Message Private Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
A Shannon-Theoretic Approach to the Storage-Retrieval Trade-Off in PIR Systems.
Inf., January, 2023

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

The Optimal Rate of MDS Variable Generation.
Proceedings of the IEEE International Symposium on Information Theory, 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

Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment.
Proceedings of the IEEE International Symposium on Information Theory, 2023

GroupSecAgg: Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.
Proceedings of the IEEE International Conference on Communications, 2023

Secure Aggregation with Uncoded Groupwise Keys Against User Collusion.
Proceedings of the 8th International Conference on Computer and Communication Systems, 2023

A Novel Scheme for Cache-Aided Multiuser Private Information Retrieval with User-to-User Privacy.
Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

2022
On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion.
IEEE Trans. Inf. Theory, 2022

Distributed Linearly Separable Computation.
IEEE Trans. Inf. Theory, 2022

Secure Groupcast With Shared Keys.
IEEE Trans. Inf. Theory, 2022

Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.
CoRR, 2022

Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user Case.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Coded Caching With Private Demands and Caches.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval.
IEEE Trans. Inf. Theory, 2021

On the Fundamental Limits of Cache-Aided Multiuser Private Information Retrieval.
IEEE Trans. Commun., 2021

On the Tradeoff Between Computation and Communication Costs for Distributed Linearly Separable Computation.
IEEE Trans. Commun., 2021

Multilevel Topological Interference Management: A TIM-TIN Perspective.
IEEE Trans. Commun., 2021

Expand-and-Randomize: An Algebraic Approach to Secure Computation.
Entropy, 2021

Cache-Aided General Linear Function Retrieval.
Entropy, 2021

Two-Level Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Information Theoretic Secure Aggregation with User Dropouts.
Proceedings of the IEEE International Symposium on Information Theory, 2021

A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Cache-Aided Matrix Multiplication Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Secure Distributed Linearly Separable Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Compound Secure Groupcast: Key Assignment for Selected Broadcasting.
Proceedings of the IEEE International Symposium on Information Theory, 2021

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

2020
Opportunistic Treating Interference as Noise.
IEEE Trans. Inf. Theory, 2020

On the Capacity of Locally Decodable Codes.
IEEE Trans. Inf. Theory, 2020

On the Capacity of Computation Broadcast.
IEEE Trans. Inf. Theory, 2020

Private Information Delivery.
IEEE Trans. Inf. Theory, 2020

Private Cache-aided Interference Alignment for Multiuser Private Information Retrieval.
Proceedings of the 18th International Symposium on Modeling and Optimization in Mobile, 2020

CHASM: Security Evaluation of Cache Mapping Schemes.
Proceedings of the Embedded Computer Systems: Architectures, Modeling, and Simulation, 2020

The Minimum Upload Cost of Symmetric Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Cache-aided Multiuser Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Cache-Aided Scalar Linear Function Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server.
Proceedings of the IEEE International Symposium on Information Theory, 2020

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

Device-to-Device Private Caching with Trusted Server.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval.
IEEE Trans. Inf. Theory, 2019

Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding.
Inf., 2019

Fundamental Limits of Device-to-Device Private Caching with Trusted Server.
CoRR, 2019

Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Opportunistic Topological Interference Management.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

The Capacity of Linear Computation Broadcast.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

On the Randomness Cost of Linear Secure Computation : (Invited Presentation).
Proceedings of the 53rd Annual Conference on Information Sciences and Systems, 2019

2018
TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite.
IEEE Trans. Inf. Theory, 2018

Multiround Private Information Retrieval: Capacity and Storage Overhead.
IEEE Trans. Inf. Theory, 2018

The Capacity of Robust Private Information Retrieval With Colluding Databases.
IEEE Trans. Inf. Theory, 2018

The ϵ-error Capacity of Symmetric PIR with Byzantine Adversaries.
Proceedings of the IEEE Information Theory Workshop, 2018

A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Capacity of Anonymous Communications.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Capacity of Private Computation.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

The Capacity of Private Information Retrieval with Eavesdroppers.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017
Replication-Based Outer Bounds: On the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks.
IEEE Trans. Inf. Theory, 2017

Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length.
IEEE Trans. Inf. Forensics Secur., 2017

Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The Capacity of Private Information Retrieval with Disjoint Colluding Sets.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks.
IEEE Trans. Inf. Theory, 2016

On the Optimality of Treating Interference as Noise for K-User Parallel Gaussian Interference Networks.
IEEE Trans. Inf. Theory, 2016

Blind interference alignment for private information retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The Capacity of Symmetric Private Information Retrieval.
Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

The Capacity of Private Information Retrieval.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

The capacity of private information retrieval with colluding databases.
Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016

2015
Rank Matching for Multihop Multiflow.
IEEE Trans. Inf. Theory, 2015

Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?
IEEE Trans. Inf. Theory, 2015

Replication-based Outer bounds and the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks.
CoRR, 2015

Fractional Coloring (Orthogonal Access) achieves All-unicast Capacity (DoF) Region of Index Coding (TIM) if and only if Network Topology is Chordal.
CoRR, 2015

On the separability of GDoF region for parallel Gaussian TIN optimal interference networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the Optimality of "Half the Cake" for K-User Rank-Deficient Mk x Mk Interference Channel.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014
Topological interference management with multiple antennas.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the optimality of treating interference as noise for parallel deterministic interference networks.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the optimality of treating interference as noise: General message sets.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Degrees of Freedom of MIMO $X$ Networks: Spatial Scale Invariance and One-Sided Decomposability.
IEEE Trans. Inf. Theory, 2013

Multilevel topological interference management.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Topological interference management with alternating connectivity.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Genie chains and the degrees of freedom of the K-user MIMO interference channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibility.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012


  Loading...