activity
20072023
most citedPrivate Information Retrieval from Coded Databases with Colluding Servers

258 citations · 705 across the 68 of their papers we have counts for

collaborators

81 papers

math.NT2023

Euclidean lattices: theory and applications

Lenny Fukshansky, Camilla Hollanti

In this editorial survey we introduce the special issue of the journal Communications in Mathematics on the topic in the title of the article. Our main goal is to briefly outline s…

cs.IT2023

-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…

cs.IT2023★ 2 cited

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…

cs.IT2022

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…

cs.IT2022

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…

cs.IT2022

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…