10 citations · 37 across the 9 of their papers we have counts for
14 papers
Info-Commit: Information-Theoretic Polynomial Commitment
Saeid Sahraei, Salman Avestimehr, Ramy E. Ali
We introduce Info-Commit, an information-theoretic protocol for polynomial commitment and verification. With the help of a trusted initializer, a succinct commitment to a private p…
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…
Increasing Availability in Distributed Storage Systems via Clustering
Saeid Sahraei, Michael Gastpar
We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS), achieving a small repair bandwidth while guaranteeing a high avai…
GDSP: A Graphical Perspective on the Distributed Storage Systems
Saeid Sahraei, Michael Gastpar
The classical distributed storage problem can be modeled by a k-uniform {\it complete} hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hype…
Multi-Library Coded Caching
Saeid Sahraei, Michael Gastpar
We study the problem of coded caching when the server has access to several libraries and each user makes independent requests from every library. The single-library scenario has b…
Users Caching Two Files: An Improved Achievable Rate
Saeid Sahraei, Michael Gastpar
Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak tra…
Polynomially Solvable Instances of the Shortest and Closest Vector Problems with Applications to Compute-and-Forward
Saeid Sahraei, Michael Gastpar
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instanc…
Compute-and-Forward: Finding the Best Equation
Saeid Sahraei, Michael Gastpar
Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. T…
New Shortest Lattice Vector Problems of Polynomial Complexity
Saeid Sahraei, Michael C. Gastpar
The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this…