19 citations · 55 across the 24 of their papers we have counts for
10 papers · 1 filter
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…
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…
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…
Non-malleable Coding for Arbitrary Varying Channels
Fuchun Lin, San Ling, Reihaneh Safavi-Naini +1
Non-malleable codes protect against an adversary who can tamper with the coded message by using a tampering function in a specified function family, guaranteeing that the tampering…
Binary de Bruijn Sequences via Zech's Logarithms
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +3
The focus of this work is to show how to combine Zech's logarithms and each of the cycle joining and cross-join pairing methods to construct binary de Bruijn sequences of any order…