5 citations · 19 across the 28 of their papers we have counts for
13 papers · 1 filter
Optimal Key Rates for Decentralized Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints
Zhou Li, Xiang Zhang, Giuseppe Caire
Decentralized secure aggregation (DSA) considers a fully-connected network of users, where each pair of users can communicate bidirectionally over an error-free channel. Each u…
The Capacity of Collusion-Resilient Decentralized Secure Aggregation with Groupwise Keys
Zhou Li, Xiang Zhang, Yizhou Zhao +3
This paper investigates the information-theoretic decentralized secure aggregation (DSA) problem under practical groupwise secret keys and collusion resilience. In DSA, users a…
ProxySelect: Frequency Selectivity-Aware Scheduling for Joint OFDMA and MU-MIMO in 802.11ax WiFi
Xiang Zhang, Michail Palaiologos, Christian Bluemm +1
IEEE 802.11ax introduces orthogonal frequency division multiple access (OFDMA) to WiFi to support concurrent transmissions to a larger number of users. As bandwidth continues to gr…
Graph-Theoretic Characterization of Noise Capacity of Conditional Disclosure of Secrets
Zhou Li, Siyan Qin, Xiang Zhang +3
In the Conditional Disclosure of Secrets (CDS) problem, Alice and Bob hold inputs and and share a secret. Let $f:\mathcal{X}\times\mathcal{Y}\…
Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor
Yi Song, Hao Xu, Kai Wan +3
A recent trend in wireless communications considers the migration of traditional monolithic base stations to the so-called disaggregated architecture, where radio units (RUs) imple…
Hierarchical Secure Aggregation with Heterogeneous Security Constraints and Arbitrary User Collusion
Zhou Li, Xiang Zhang, Jiawen Lv +3
In hierarchical secure aggregation (HSA), a server communicates with clustered users through an intermediate layer of relays to compute the sum of users' inputs under two security…
Downlink CSIT under Compressed Feedback: Joint vs. Separate Source-Channel Coding
Yi Song, Tianyu Yang, Mahdi Barzegar Khalilsarai +1
The acquisition of Downlink (DL) channel state information at the transmitter (CSIT) is known to be a challenging task in multiuser massive MIMO systems when uplink/downlink channe…
Multi-Message Secure Aggregation with Demand Privacy
Chenyi Sun, Ziting Zhang, Kai Wan +1
This paper considers a multi-message secure aggregation with privacy problem, in which a server aims to compute linear combinations of local inputs from dis…
Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association
Xiang Zhang, Zhou Li, Kai Wan +3
Secure aggregation is motivated by federated learning (FL) where a cloud server aims to compute an {aggregated} model (i.e., weights of deep neural networks) of the locally-trained…
A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing
Minquan Cheng, Huimei Wei, Kai Wan +1
Coded caching is a promising technique to effectively reduce peak traffic by using local caches and the multicast gains generated by these local caches. We prefer to design a coded…
Hierarchical Gradient Coding: From Optimal Design to Privacy at Intermediate Nodes
Ali Gholami, Tayyebeh Jahani-Nezhad, Kai Wan +1
Gradient coding is a distributed computing technique for computing gradient vectors over large datasets by outsourcing partial computations to multiple workers, typically connected…
PDA Construction via Union of Cartesian Product Cache Configurations for Coded Caching
Jinyu Wang, Minquan Cheng, Kai Wan +1
Caching is an efficient technique to reduce peak traffic by storing popular content in local caches. Placement delivery array (PDA) proposed by Yan et al. is a combinatorial struct…
Collaborative Coded Caching for Partially Connected Networks
Kagan Akcay, Eleftherios Lampiris, MohammadJavad Salehi +1
Coded caching leverages the differences in user cache memories to achieve gains that scale with the total cache size, alleviating network congestion due to high-quality content req…