2 citations · 4 across the 8 of their papers we have counts for
4 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…
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…