34 citations · 41 across the 17 of their papers we have counts for
16 papers · 1 filter
Secure Multi-Access Coded Caching: A Lifting Approach
Han Fang, Qinyi Lu, Nan Liu +1
We construct secure cyclic multi-access coded caching schemes by re-encoding the caches of a secure single-access scheme and reusing its multicast message unchanged. For a library…
Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
Han Fang, Nan Liu, Wei Kang
Secure device-to-device (D2D) caching requires users to generate delivery signals from their own caches and to recover their requested files without learning the other files. We co…
Improved Characterization of the Memory-Rate Tradeoff for Demand-Private Coded Caching With Multiple Demands
Qinyi Lu, Nan Liu, Wei Kang +1
We consider a coded caching problem with multiple demands under a privacy constraint. In this problem, a server with access to files serves users over a shared link, and ea…
Movable Antenna Assisted Dual-Polarized Multi-Cell Cooperative AirComp: An Alternating Optimization Approach
Mingyu Hu, Nan Liu, Wei Kang
Over-the-air computation (AirComp) is a key enabler for distributed optimization, since it leverages analog waveform superposition to perform aggregation and thereby mitigates the…
Sum Rate optimization for RIS-Aided RSMA system with Movable Antenna
Mingyu Hu, Nan Liu, Wei Kang
Rate-Splitting Multiple Access (RSMA) is a key enabling technique for sixth-generation (6G) wireless systems due to its powerful interference management, and Reconfigurable Intelli…
Characterizing the Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate
Han Fang, Nan Liu, Wei Kang
We consider the secure coded caching problem proposed by Ravindrakumar et. al where no user can obtain information about files other than the one requested. We first propose three…
Demand Private Coded Caching: Small Cache Size
Qinyi Lu, Nan Liu, Wei Kang +1
We investigate the demand private coded caching problem, which is an coded caching problem with files, users, each equipped with a cache of size , and an additio…
Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links
Qinyi Lu, Jiale Cheng, Wei Kang +1
The growing privacy concerns in distributed learning have led to the widespread adoption of secure aggregation techniques in distributed machine learning systems, such as federated…
Demand Private Coded Caching: the Two-File Case
Qinyi Lu, Nan Liu, Wei Kang
We investigate the demand private coded caching problem, which is an coded caching problem with files, users, each equipped with a cache of size , and an additio…
Multiple Threshold Schemes Under The Weak Secure Condition
Jiahong Wu, Nan Liu, Wei Kang
In this paper, we consider the case that sharing many secrets among a set of participants using the threshold schemes. All secrets are assumed to be statistically independent and t…
A Cyclic Placement Strategy for Multi-access Coded Caching
Zeru Chen, Nan Liu, Wei Kang
We investigate the multi-access coded caching problem, which involves files, users, and caches in this paper. Each user can access adjacent caches in a cyclic manne…
The Capacity Region of Distributed Multi-User Secret Sharing under The Perfect Privacy Condition
Jiahong Wu, Nan Liu, Wei Kang
We study the distributed multi-user secret sharing (DMUSS) problem under the perfect privacy condition. In a DMUSS problem, multiple secret messages are deployed and the shares are…
On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection
Jiale Cheng, Nan Liu, Wei Kang
We formulate a new secure distributed computation problem, where a simulation center can require any linear combination of users' data through a caching layer consisting of $…
Resource Allocation for Uplink Cell-Free Massive MIMO enabled URLLC in a Smart Factory
Qihao Peng, Hong Ren, Cunhua Pan +2
Smart factories need to support the simultaneous communication of multiple industrial Internet-of-Things (IIoT) devices with ultra-reliability and low-latency communication (URLLC)…
Three-user D2D Coded Caching with Two Random Requesters and One Sender
Wuqu Wang, Nan Liu, Wei Kang
In device-to-device (D2D) coded caching problems, it is possible that not all users will make file requests in the delivery phase. Hence, we propose a new D2D centralized coded cac…
Capacity Results for the Wiretapped Oblivious Transfer
Tianyou Pei, Wei Kang, Nan Liu
In this paper, we study the problem of the 1-of-2 string oblivious transfer (OT) between Alice and Bob in the presence of a passive eavesdropper Eve. The eavesdropper Eve is not al…