activity
20132026
most citedLagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy

206 citations · 239 across the 40 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

cs.IT2018

Private Polynomial Computation from Lagrange Encoding

Netanel Raviv, David A. Karpuk

Private computation is a generalization of private information retrieval, in which a user is able to compute a function on a distributed dataset without revealing the identity of t…

cs.IT2018

Private Information Retrieval in Graph Based Replication Systems

Netanel Raviv, Itzhak Tamo, Eitan Yaakobi

In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol i…

cs.IT2018★ 6 cited

On Coding over Sliced Information

Jin Sima, Netanel Raviv, Jehoshua Bruck

The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In t…

cs.IT2018

Two Deletion Correcting Codes from Indicator Vectors

Jin Sima, Netanel Raviv, Jehoshua Bruck

Construction of capacity achieving deletion correcting codes has been a baffling challenge for decades. A recent breakthrough by Brakensiek ., alongside novel applications i…

cs.IT2018★ 206 cited

Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy

Qian Yu, Songze Li, Netanel Raviv +3

We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms. We propo…

cs.IT2018

Hierarchical Erasure Correction of Linear Codes

Netanel Raviv, Moshe Schwartz, Rami Cohen +1

Linear codes over finite extension fields have widespread applications in theory and practice. In some scenarios, the decoder has a sequential access to the codeword symbols, givin…