Between Close Enough to Reveal and Far Enough to Protect: a New Privacy Region for Correlated Data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maßny, Luis, Bitar, Rawad, Ye, Fangwei, Rouayheb, Salim El
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
by: Bitar, Rawad, et al.
Published: (2018)

Minimizing Latency for Secure Distributed Computing
by: Bitar, Rawad, et al.
Published: (2017)

Perfect Privacy and Strong Stationary Times for Markovian Sources
by: Ye, Fangwei, et al.
Published: (2026)

Byzantine-Resilient Gradient Coding through Local Gradient Computations
by: Hofmeister, Christoph, et al.
Published: (2024)

Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
by: Jain, Shreyas, et al.
Published: (2024)

Self-Regulating Random Walks for Resilient Decentralized Learning on Graphs
by: Egger, Maximilian, et al.
Published: (2024)

Federated One-Shot Learning with Data Privacy and Objective-Hiding
by: Egger, Maximilian, et al.
Published: (2025)

Fundamental Limits of Decentralized Self-Regulating Random Walks
by: Khalesi, Ali, et al.
Published: (2026)

Random Access Expectation in DNA Storage and Fountain Codes
by: Hofmeister, Christoph, et al.
Published: (2026)

Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors
by: Egger, Maximilian, et al.
Published: (2025)

ProDiGy: Proximity- and Dissimilarity-Based Byzantine-Robust Federated Learning
by: Ergisi, Sena, et al.
Published: (2025)

Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning
by: Egger, Maximilian, et al.
Published: (2025)

Beyond Trade-offs: A Unified Framework for Privacy, Robustness, and Communication Efficiency in Federated Learning
by: Xia, Yue, et al.
Published: (2025)

Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning
by: Xia, Yue, et al.
Published: (2025)

CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
by: Hofmeister, Christoph, et al.
Published: (2025)

The Entrapment Problem in Random Walk Decentralized Learning
by: Liu, Zonghong, et al.
Published: (2024)

Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy Compromises
by: Xia, Yue, et al.
Published: (2024)

The Gatekeeper Knows Enough
by: Abebayew, Fikresilase Wondmeneh
Published: (2025)

Coding Schemes for Document Exchange under Multiple Substring Edits
by: Narayanan, Hrishi, et al.
Published: (2026)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs
by: Hofmeister, Christoph, et al.
Published: (2024)

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
by: Egger, Maximilian, et al.
Published: (2024)

Secure Distributed Matrix Multiplication with Precomputation
by: Cartor, Ryann, et al.
Published: (2024)

Softmax is not Enough (for Sharp Size Generalisation)
by: Veličković, Petar, et al.
Published: (2024)

On the Extension of Private Distributed Matrix Multiplication Schemes to the Grid Partition
by: Hofmeister, Christoph, et al.
Published: (2026)

The Art of Misclassification: Too Many Classes, Not Enough Points
by: Franco, Mario, et al.
Published: (2025)

Maximal-Capacity Discrete Memoryless Channel Identification
by: Egger, Maximilian, et al.
Published: (2024)

LoByITFL: Low Communication Secure and Private Federated Learning
by: Xia, Yue, et al.
Published: (2024)

Secure Over-the-Air Computation Against Multiple Eavesdroppers using Correlated Artificial Noise
by: Nordlund, David, et al.
Published: (2025)

Source Anonymity for Private Random Walk Decentralized Learning
by: Egger, Maximilian, et al.
Published: (2025)

BICompFL: Stochastic Federated Learning with Bi-Directional Compression
by: Egger, Maximilian, et al.
Published: (2025)

Scalable and Reliable Over-the-Air Federated Edge Learning
by: Egger, Maximilian, et al.
Published: (2024)

Massive MIMO Channel Prediction Via Meta-Learning and Deep Denoising: Is a Small Dataset Enough?
by: Kim, Hwanjin, et al.
Published: (2022)

Theoretical and Experimental Assessment of Large Beam Codebook at mmWave Devices: How Much is Enough?
by: Bozkurt, Bora, et al.
Published: (2025)

Pseudo Relevance Feedback is Enough to Close the Gap Between Small and Large Dense Retrieval Models
by: Li, Hang, et al.
Published: (2025)

Convenience Is Not Enough
by: Harvel, Lonnie D.
Published: (2006)

Access Isn't Enough: Merely Connecting People and Computers Won't Close the Digital Divide.
by: Blau, Andrew
Published: (2002)

Balancing Privacy and Utility in Correlated Data: A Study of Bayesian Differential Privacy
by: Lange, Martin, et al.
Published: (2025)

Composition Theorems for Multiple Differential Privacy Constraints
by: Cadir, Cemre, et al.
Published: (2026)

The Hidden Cost of Correlation: Rethinking Privacy Leakage in Local Differential Privacy
by: Jayawardana, Sandaru, et al.
Published: (2025)