Saeid Sahraei

Orcid: 0000-0002-3881-6481

According to our database1, Saeid Sahraei authored at least 17 papers between 2010 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Info-Commit: Information-Theoretic Polynomial Commitment.
IEEE Trans. Inf. Forensics Secur., 2022

2021
Interactive Verifiable Polynomial Evaluation.
IEEE J. Sel. Areas Inf. Theory, 2021

2020
InfoCommit: Information-Theoretic Polynomial Commitment and Verification.
IACR Cryptol. ePrint Arch., 2020

2019
The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement.
IEEE Trans. Inf. Theory, 2019

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains.
IACR Cryptol. ePrint Arch., 2019

Coded State Machine - Scaling State Machine Execution under Byzantine Faults.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

INTERPOL: Information Theoretically Verifiable Polynomial Evaluation.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Caching and Distributed Storage - Models, Limits and Designs.
PhD thesis, 2018

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands.
CoRR, 2018

Increasing Availability in Distributed Storage Systems via Clustering.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward.
IEEE Trans. Inf. Theory, 2017

GDSP: A graphical perspective on the distributed storage systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
K users caching two files: An improved achievable rate.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

Multi-library coded caching.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2014
New Shortest Lattice Vector Problems of Polynomial Complexity.
CoRR, 2014

Compute-and-Forward: Finding the best equation.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2010
Effect of Power Randomization on Saturation Throughput of IEEE 802.11 WLAN.
Proceedings of IEEE International Conference on Communications, 2010


  Loading...