2 citations · 4 across the 8 of their papers we have counts for
10 papers
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
Stanislav Kruglik, Gaojun Luo, Wilton Kim +4
We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we co…
-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size
Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1
We consider the problem of designing a Private Information Retrieval (PIR) scheme on files replicated on servers that can collude or, even worse, can return incorrect answe…
Committed Private Information Retrieval
Quang Cao, Hong Yen Tran, Son Hoang Dau +7
A private information retrieval (PIR) scheme allows a client to retrieve a data item among items from servers, without revealing what is even…
Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification
Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah +1
Private Information Retrieval (PIR) schemes allow a client to retrieve any file of interest, while hiding the file identity from the database servers. In contrast to most existing…
Verifiable Coded Computation of Multiple Functions
Wilton Kim, Stanislav Kruglik, Han Mao Kiah
We consider the problem of evaluating distinct multivariate polynomials over several massive datasets in a distributed computing system with a single master node and multiple worke…
Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols
Han Mao Kiah, Wilton Kim, Stanislav Kruglik +2
Motivated by applications in distributed storage, distributed computing, and homomorphic secret sharing, we study communication-efficient schemes for computing linear combinations…
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…
On One Generalization of LRC Codes with Availability
Stanislav Kruglik, Marina Dudina, Valeriya Potapova +1
We investigate one possible generalization of locally recoverable codes (LRC) with all-symbol locality and availability when recovering sets can intersect in a small number of coor…
A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes
Stanislav Kruglik, Valeriya Potapova, Alexey Frolov
An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base…
Bounds and Constructions of Codes with All-Symbol Locality and Availability
Stanislav Kruglik, Alexey Frolov
We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance…