8 papers
Big Secrets Small Shares: Revisiting Secure Multi-Party Computation
Wilton Kim, Van Long Phuoc Pham, Stanislav Kruglik +1
At CRYPTO 2007, Damgård and Nielsen introduced a preprocessing approach to multi-party computation (MPC) to achieve linear communication complexity. Another approach to reduce comm…
Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
Rimpi Borah, Wilton Kim, J. Harshan +2
Coded computing mitigates stragglers in distributed computation. While Lagrange coded computing (LCC) enables exact polynomial computation over finite fields, Berrut approximated c…
Linear Code Conversion in the Merge Regime: General Bounds and Reed-Muller Constructions
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Erasure codes are a core component of most existing large-scale distributed storage systems, ensuring reliability against node failures. Recent work has shown that adapting code pa…
Robust Repair of Reed-Solomon Codes
Wilton Kim, Stanislav Kruglik, Gaojun Luo +1
We study the problem of robust repair of a single erasure in Reed--Solomon codes under low communication bandwidth. Focusing on the Guruswami--Wootters trace repair framework, we i…
Convertible Codes for Data and Device Heterogeneity
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Distributed storage systems must handle both data heterogeneity, arising from non-uniform access demands, and device heterogeneity, caused by time-varying node reliability. In this…
Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection
Wilton Kim, Stanislav Kruglik, Han Mao Kiah
Repairing Reed-Solomon codes with low bandwidth is a central challenge in distributed storage. Following the trace-repair framework of Guruswami and Wootters (2017), recent works b…
Repairing Reed-Solomon Codes with Side Information
Thi Xinh Dinh, Ba Thong Le, Son Hoang Dau +6
We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side informat…
Private Repair of a Single Erasure in Reed-Solomon Codes
Stanislav Kruglik, Han Mao Kiah, Son Hoang Dau +1
We investigate the problem of privately recovering a single erasure for Reed-Solomon codes with low communication bandwidths. For an code with ,…