9 citations · 14 across the 4 of their papers we have counts for
7 papers
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains
Mingchao Yu, Saeid Sahraei, Songze Li +3
In this paper, we propose coded Merkle tree (CMT), a novel hash accumulator that offers a constant-cost protection against data availability attacks in blockchains, even if the maj…
Interactive Verifiable Polynomial Evaluation
Saeid Sahraei, Mohammad Ali Maddah-Ali, Salman Avestimehr
Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithm…
Coded State Machine -- Scaling State Machine Execution under Byzantine Faults
Songze Li, Saeid Sahraei, Mingchao Yu +3
We introduce an information-theoretic framework, named Coded State Machine (CSM), to securely and efficiently execute multiple state machines on untrusted network nodes, some of wh…
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation
Saeid Sahraei, A. Salman Avestimehr
We study the problem of verifiable polynomial evaluation in the user-server and multi-party setups. We propose {INTERPOL}, an information-theoretically verifiable algorithm that al…
The Optimal Memory-Rate Trade-off for the Non-uniform Centralized Caching Problem with Two Files under Uncoded Placement
Saeid Sahraei, Pierre Quinton, Michael Gastpar
A new scheme for the problem of centralized coded caching with non-uniform demands is proposed. The distinguishing feature of the proposed placement strategy is that it admits equa…
A Novel Centralized Strategy for Coded Caching with Non-uniform Demands
Pierre Quinton, Saeid Sahraei, Michael Gastpar
Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a…