206 citations · 239 across the 40 of their papers we have counts for
55 papers
The Capacity of the Noisy Torn Paper Channel and the Noisy Shuffling Channel
Junsheng Liu, Netanel Raviv
The torn paper channel breaks a codeword into fragments and returns all fragments without their original order. The noisy torn paper channel additionally introduces bit substitutio…
Protecting Sensitive Data in Image Synthesis via PAC-Private Adaptation for Diffusion Models
Boming Miao, Tao Zhang, Netanel Raviv +3
Synthetic data are increasingly used as an alternative to sharing sensitive records. However, synthetic data generation does not guarantee privacy, as diffusion models trained or a…
Capacity Achieving Torn Paper Codes
Junsheng Liu, Netanel Raviv
In the torn paper channel, a codeword is cut at random locations, and the resulting error-free fragments are delivered to the decoder as an unordered multiset. Although the capacit…
Improved Torn Paper Coding via Local Alignment
Junsheng Liu, Netanel Raviv
In the torn paper channel, a transmitted codeword is broken at random locations into fragments that arrive at the decoder in an unordered manner. A central theoretical challenge wi…
Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Computing multi-source partial information decomposition (PID) for continuous data is hard: existing closed-form Gaussian estimators are restricted to two source variables, while c…
Structural Impossibility of Antichain-Lattice Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Partial Information Decomposition (PID) represents multivariate mutual information via antichain-lattice that aims to specify which source groups can recover which informational co…
Break-Resilient Codes with Loss Tolerance
Canran Wang, Minghui Liwang, Netanel Raviv
Emerging applications in manufacturing, wireless communication, and molecular data storage require robust coding schemes that remain effective under physical distortions where code…
Efficient Vector Symbolic Architectures from Histogram Recovery
Zirui Deng, Netanel Raviv
Vector symbolic architectures (VSAs) are a family of information representation techniques which enable composition, i.e., creating complex information structures from atomic vecto…
The Whole Is Less than the Sum of Parts: Subsystem Inconsistency in Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Partial Information Decomposition (PID) was proposed by Williams and Beer in 2010 as a tool for analyzing fine-grained interactions between multiple random variables, and has since…
Single Fragment Forensic Coding from Discrepancy Theory
Junsheng Liu, Netanel Raviv
Three-dimensional (3D) printing's accessibility enables rapid manufacturing but also poses security risks, such as the unauthorized production of untraceable firearms and prohibite…
Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures
Aobo Lyu, Andrew Clark, Netanel Raviv
While mutual information effectively quantifies dependence between two variables, it does not by itself reveal the complex, fine-grained interactions among variables, i.e., how mul…
Individual Confidential Computing of Polynomials over Non-Uniform Information
Saar Tarnopolsky, Zirui, Deng +3
In this paper, we address the problem of secure distributed computation in scenarios where user data is not uniformly distributed, extending existing frameworks that assume uniform…
-MSR Codes for Any Set of Helper Nodes
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount o…
On the Encoding Process in Decentralized Systems
Canran Wang, Netanel Raviv
We consider the problem of encoding information in a system of N=K+R processors that operate in a decentralized manner, i.e., without a central processor which orchestrates the ope…
Differential Confounding Privacy and Inverse Composition
Tao Zhang, Bradley A. Malin, Netanel Raviv +1
Differential privacy (DP) has become the gold standard for privacy-preserving data analysis, but its applicability can be limited in scenarios involving complex dependencies betwee…
Non-Binary Covering Codes for Low-Access Computations
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing…
Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
Zirui Deng, Vinayak Ramkumar, Netanel Raviv
Delegating large-scale computations to service providers is a common practice which raises privacy concerns. This paper studies information-theoretic privacy-preserving delegation…
Linear Codes for Hyperdimensional Computing
Netanel Raviv
Hyperdimensional Computing (HDC) is an emerging computational paradigm for representing compositional information as high-dimensional vectors, and has a promising potential in appl…
Secure Information Embedding in Forensic 3D Fingerprinting
Canran Wang, Jinwen Wang, Mi Zhou +5
Printer fingerprinting techniques have long played a critical role in forensic applications, including the tracking of counterfeiters and the safeguarding of confidential informati…
Explicit Formula for Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv
Mutual information between two random variables is a well-studied notion, whose understanding is fairly complete. Mutual information between one random variable and a pair of other…
Private Inference in Quantized Models
Zirui Deng, Vinayak Ramkumar, Rawad Bitar +1
A typical setup in many machine learning scenarios involves a server that holds a model and a user that possesses data, and the challenge is to perform inference while safeguarding…
Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection
Bahram Yaghooti, Netanel Raviv, Bruno Sinopoli
Feature extraction and selection in the presence of nonlinear dependencies among the data is a fundamental challenge in unsupervised learning. We propose using a Gram-Schmidt (GS)…
Error Correction for DNA Storage
Jin Sima, Netanel Raviv, Moshe Schwartz +1
DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes,…
Break-Resilient Codes
Canran Wang, Jin Sima, Netanel Raviv
We investigate the problem of encoding data into an -break-resilient code (-BRC), i.e., a collections of sequences of length~ from which the original data can be…