10 papers
Structured lattices and their applications to security
Lenny Fukshansky, Camilla Hollanti, Rahinatou Y. Njah Nchiwo
Euclidean lattices are an interesting object of study in many regards and can have a rich structure arising from various constructions, e.g., from number field extensions. A partic…
Existence and Constructions of Strict Function-Correcting Codes with Data Protection
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives stric…
Function-Correcting Partition Codes
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
We introduce function-correcting partition codes (FCPCs), which are a natural generalization of function-correcting codes (FCCs). An FCPC is defined directly on a partition of the…
Non-Existence of Some Function-Correcting Codes With Data Protection
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
In this paper, we consider the recently introduced concept of \emph{function-correcting codes (FCCs) with data protection}, which provide a certain level of error protection for th…
A -Polymatroid Framework for Information Leakage in Secure Linear Network Coding
Eimear Byrne, Johan Vester Dinesen, Ragnar Freij-Hollanti +1
We study information leakage in secure linear network coding schemes based on nested rank-metric codes. We show that the amount of information leaked to an adversary that observes…
Function-Correcting Codes With Data Protection
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the…
The Star Product of Uniformly Random Codes
Johan Vester Dinesen, Ragnar Freij-Hollanti, Camilla Hollanti +2
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We use a corr…
Perfectly-Private Analog Secure Aggregation in Federated Learning
Delio Jaramillo-Velez, Charul Rajput, Ragnar Freij-Hollanti +2
In federated learning, multiple parties train models locally and share their parameters with a central server, which aggregates them to update a global model. To address the risk o…
Secret Sharing in the Rank Metric
Johan Vester Dinesen, Eimear Byrne, Ragnar Freij-Hollanti +1
The connection between secret sharing and matroid theory is well established. In this paper, we generalize the concepts of secret sharing and matroid ports to -polymatroids. Spe…
Function-Correcting Codes for Locally Bounded Functions
Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1
In this paper, we introduce a class of functions that assume only a limited number of values within a given Hamming -ball and call them locally -bounded functions. W…