258 citations · 705 across the 68 of their papers we have counts for
68 papers · 1 filter
-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks
Matteo Allaix, Yuxiang Lu, Yuhang Yao +3
Linear computations over quantum many-to-one communication networks offer opportunities for communication cost improvements through schemes that exploit quantum entanglement among…
Algebraic Geometry Codes for Secure Distributed Matrix Multiplication
Okko Makkonen, Elif Saçıkara, Camilla Hollanti
In this paper, we propose a novel construction for secure distributed matrix multiplication (SDMM) based on algebraic geometry (AG) codes, which we call the PoleGap SDMM scheme. Th…
Secure Distributed Gram Matrix Multiplication
Okko Makkonen, Camilla Hollanti
The Gram matrix of a matrix is defined as (or ). Computing the Gram matrix is an important operation in many applications, such as linear regression with the lea…
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
Okko Makkonen, Camilla Hollanti
In this paper, a general framework for linear secure distributed matrix multiplication (SDMM) is introduced. The model allows for a neat treatment of straggling and Byzantine serve…
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes
Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti +1
In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous…
On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers
Matteo Allaix, Seunghoan Song, Lukas Holzbaur +3
In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file.…
Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers
Jie Li, Camilla Hollanti
In this paper, we study the problem of \emph{private and secure distributed matrix multiplication (PSDMM)}, where a user having a private matrix and non-colluding servers s…
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR
Jie Li, Okko Makkonen, Camilla Hollanti +1
This work considers the problem of privately outsourcing the computation of a matrix product over a finite field to helper servers. These servers are considered…
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes
Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identit…
Computational Code-Based Single-Server Private Information Retrieval
Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh
A new computational private information retrieval (PIR) scheme based on random linear codes is presented. A matrix of messages from a McEliece scheme is used to query the server wi…
Quantum Private Information Retrieval from Coded and Colluding Servers
Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identit…
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh +2
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring , where is a prime and is a positive integer. LRPC…
Towards Practical Private Information Retrieval from MDS Array Codes
Jie Li, David Karpuk, Camilla Hollanti
Private information retrieval (PIR) is the problem of privately retrieving one out of original files from severs, i.e., each individual server learns nothing about the file…
Uniform Minors in Maximally Recoverable Codes
Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti +1
In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matro…
Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers
Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li +1
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-r…
A Generic Transformation for Optimal Node Repair in MDS Array Codes over
Jie Li, Xiaohu Tang, Camilla Hollanti
For high-rate linear systematic maximum distance separable (MDS) codes, most early constructions could initially optimally repair all the systematic nodes but not all the parity no…
The Complete Hierarchical Locality of the Punctured Simplex Code
Matthias Grezet, Camilla Hollanti
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by…
Private Information Retrieval Schemes with Regenerating Codes
Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti +1
A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes…
Private Information Retrieval over Random Linear Networks
Razane Tajeddine, Antonia Wachter-Zeh, Camilla Hollanti
In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the m…
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +1
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by…
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2
The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an …
Private Streaming with Convolutional Codes
Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh +1
Recently, information-theoretic private information retrieval (PIR) from coded storage systems has gained a lot of attention, and a general star product PIR scheme was proposed. In…
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used f…
t-Private Information Retrieval Schemes Using Transitive Codes
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti +3
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR sc…