Hua Sun

IEEE Trans. Inf. Theory, April, 2024

Secure Summation: Capacity Region, Groupwise Key, and Feasibility.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2024

Coded Caching With Private Demands and Caches.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2024

2023

On the Linear Capacity of Conditional Disclosure of Secrets.

[BibT_eX]

[DOI]

IEEE Trans. Commun., December, 2023

A Shannon-Theoretic Approach to the Storage-Retrieval Trade-Off in PIR Systems.

[BibT_eX]

[DOI]

Jun Chen

Inf., January, 2023

On Extremal Rates of Secure Storage Over Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2023

The Capacity Region of Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.

[BibT_eX]

[DOI]

CoRR, 2023

The Optimal Rate of MDS Variable Generation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Weakly Secure Summation with Colluding Users.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

GroupSecAgg: Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

Secure Aggregation with Uncoded Groupwise Keys Against User Collusion.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

2022

Information Theoretic Secure Aggregation With User Dropouts.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Cache-Aided Matrix Multiplication Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Distributed Linearly Separable Computation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Secure Groupcast With Shared Keys.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2022

Two-Level Private Information Retrieval.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2022

Compound Secure Groupcast: Key Assignment for Selected Broadcasting.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2022

On Secure Distributed Linearly Separable Computation.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

MDS Variable Generation and Secure Summation with User Selection.

[BibT_eX]

[DOI]

CoRR, 2022

Information Theoretic Secure Aggregation with Uncoded Groupwise Keys.

[BibT_eX]

[DOI]

CoRR, 2022

Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user Case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On the Fundamental Limits of Cache-Aided Multiuser Private Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2021

On the Tradeoff Between Computation and Communication Costs for Distributed Linearly Separable Computation.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2021

Multilevel Topological Interference Management: A TIM-TIN Perspective.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2021

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

[BibT_eX]

[DOI]

Entropy, 2021

Cache-Aided General Linear Function Retrieval.

[BibT_eX]

[DOI]

Entropy, 2021

A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Opportunistic Treating Interference as Noise.

[BibT_eX]

[DOI]

Xinping Yi

IEEE Trans. Inf. Theory, 2020

On the Capacity of Locally Decodable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On the Capacity of Computation Broadcast.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Private Information Delivery.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Opportunistic Topological Interference Management.

[BibT_eX]

[DOI]

Xinping Yi

IEEE Trans. Commun., 2020

Private Cache-aided Interference Alignment for Multiuser Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Modeling and Optimization in Mobile, 2020

CHASM: Security Evaluation of Cache Mapping Schemes.

[BibT_eX]

[DOI]

Proceedings of the Embedded Computer Systems: Architectures, Modeling, and Simulation, 2020

The Minimum Upload Cost of Symmetric Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Cache-aided Multiuser Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Cache-Aided Scalar Linear Function Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Device-to-Device Private Caching with Trusted Server.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019

The Capacity of Private Information Retrieval With Eavesdroppers.

[BibT_eX]

[DOI]

Qiwen Wang

Mikael Skoglund

IEEE Trans. Inf. Theory, 2019

Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost.

[BibT_eX]

[DOI]

Jun Chen

IEEE Trans. Inf. Theory, 2019

The Capacity of Private Computation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Capacity of Symmetric Private Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Capacity of Anonymous Communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval.

[BibT_eX]

[DOI]

Zhuqing Jia

IEEE Trans. Inf. Theory, 2019

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

[BibT_eX]

[DOI]

Inf., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness.

[BibT_eX]

[DOI]

Qiwen Wang

Mikael Skoglund

Proceedings of the IEEE International Symposium on Information Theory, 2019

The Capacity of Linear Computation Broadcast.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Communications, 2019

On the Randomness Cost of Linear Secure Computation : (Invited Presentation).

[BibT_eX]

[DOI]

Yanliang Zhou

Shengli Fu

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Multiround Private Information Retrieval: Capacity and Storage Overhead.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

The Capacity of Robust Private Information Retrieval With Colluding Databases.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

The ϵ-error Capacity of Symmetric PIR with Byzantine Adversaries.

[BibT_eX]

[DOI]

Qiwen Wang

Mikael Skoglund

Proceedings of the IEEE Information Theory Workshop, 2018

A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems.

[BibT_eX]

[DOI]

Jun Chen

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Replication-Based Outer Bounds: On the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks.

[BibT_eX]

[DOI]

Bofeng Yuan

IEEE Trans. Inf. Theory, 2017

The Capacity of Private Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2017

The Capacity of Private Information Retrieval with Disjoint Colluding Sets.

[BibT_eX]

[DOI]

Zhuqing Jia

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks.

[BibT_eX]

[DOI]

Chenwei Wang

IEEE Trans. Inf. Theory, 2016

On the Optimality of Treating Interference as Noise for K-User Parallel Gaussian Interference Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Blind interference alignment for private information retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

The capacity of private information retrieval with colluding databases.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016

2015

Rank Matching for Multihop Multiflow.

[BibT_eX]

[DOI]

Sundar R. Krishnamurthy

IEEE Trans. Inf. Theory, 2015

Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

On the Optimality of Treating Interference as Noise: General Message Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

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

[BibT_eX]

[DOI]

Bofeng Yuan

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

On the separability of GDoF region for parallel Gaussian TIN optimal interference networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Bofeng Yuan

Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014

Topological interference management with multiple antennas.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Tiangao Gou

IEEE Trans. Inf. Theory, 2013

Multilevel topological interference management.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Topological interference management with alternating connectivity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Chenwei Wang