麻豆传媒AV

CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning

Submitted by admin on Mon, 10/28/2024 - 01:24

How to train a machine learning model while keeping the data private and secure? We present CodedPrivateML, a fast and scalable approach to this critical problem. CodedPrivateML keeps both the data and the model information-theoretically private, while allowing efficient parallelization of training across distributed workers. We characterize CodedPrivateML鈥檚 privacy threshold and prove its convergence for logistic (and linear) regression.

Two-Stage Biometric Identification Systems Without Privacy Leakage

Submitted by admin on Mon, 10/28/2024 - 01:24

We study two-stage biometric identification systems that allow authentication without privacy leakage. In the enrollment phase, secret keys and two layers of the helper data for each user are generated. Additional to the helper data and secret keys, we also introduce private keys in the systems. In the identification phase, an unknown but previously enrolled user is observed, and the user's private key is also presented to the system. The system firstly compares the user with the first layer helper database, outputs a list, and obtains a set of user indices.

Secure MISO Broadcast Channel: An Interplay Between CSIT and Network Topology

Submitted by admin on Mon, 10/28/2024 - 01:24

We study the problem of secure transmission over a Gaussian two-user multi-input single-output (MISO) broadcast channel (BC) under the assumption that links connecting the transmitter to the two receivers may have unequal strength statistically. In addition to this, the state of the channel to each receiver is conveyed in a delayed manner to the transmitter. We focus on a two state topological setting of strong v.s. weak links.

Editorial

Submitted by admin on Mon, 10/28/2024 - 01:24
Welcome to the third issue of the Journal on Selected Areas in Information Theory (JSAIT), focusing on 鈥淓stimation and Inference鈥 in modern information sciences.

Recovering Data Permutations From Noisy Observations: The Linear Regime

Submitted by admin on Mon, 10/28/2024 - 01:24

This article considers a noisy data structure recovery problem. The goal is to investigate the following question: given a noisy observation of a permuted data set, according to which permutation was the original data sorted? The focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the noise is additive Gaussian with an arbitrary covariance matrix. This problem is posed within a hypothesis testing framework.