activity
20172022
most citedTowards the Capacity of Private Information Retrieval from Coded and Colluding Servers

22 citations · 47 across the 11 of their papers we have counts for

collaborators
Showing 2020Show all

9 papers · 1 filter

cs.IT2020

Decoding of Lifted Affine-Invariant Codes

Lukas Holzbaur, Nikita Polyanskii

Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller c…

cs.IT2020

Decoding of Interleaved Alternant Codes

Lukas Holzbaur, Hedongliang Liu, Alessandro Neri +4

Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a…

cs.IT2020

Partial MDS Codes with Regeneration

Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD co…

cs.IT2020

Lifted Multiplicity Codes

Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +2

Lifted Reed-Solomon codes and multiplicity codes are two classes of evaluation codes that allow for the design of high-rate codes that can recover every codeword or information sym…

cs.IT2020

Lifted Reed-Solomon Codes with Application to Batch Codes

Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +1

Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluatio…

cs.IT2020

Secrecy and Accessibility in Distributed Storage

Lukas Holzbaur, Stanislav Kruglik, Alexey Frolov +1

A distributed storage system (DSS) needs to be efficiently accessible and repairable. Recently, considerable effort has been made towards the latter, while the former is usually no…

cs.IT2020

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…

cs.IT2020

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…

cs.IT2020

Partial MDS Codes with Local Regeneration

Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where e…