Nicolas Alhaddad
Postdoctoral Associate
Boston University Graduate School of Arts and Sciences



Publications listed below are automatically derived from MEDLINE/PubMed and other sources, which might result in incorrect or missing publications. Faculty can login to make corrections and additions.

iCite Website       Copy PMIDs To Clipboard

  1. Alhaddad N, Duan S, Varia M, Wang H, Zhang H . Efficient Byzantine Broadcast From Succinct Erasure Coding Proof System. Institute of Electrical and Electronics Engineers. 2025; 20:8583 - 8596. View Publication
  2. Alhaddad N, Reyzin L, Varia M. Committing AVID with Partial Retrieval and Optimal Storage. Cryptology ePrint Archive. 2024. View Publication
  3. Alhaddad N, Varia M, Yang Z . Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications. Cryptology ePrint Archive. 2024. View Publication
  4. Alhaddad N, Das S, Duan S, Ren L, Varia M, Xiang Z, Zhang H. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. 2022 ACM Symposium on Principles of Distributed Computing. 2022. View Publication
  5. Alhaddad N, Das S, Duan S, Ren L, Varia M, Xiang Z, Zhang H. Brief announcement: Asynchronous verifiable information dispersal with near-optimal communication. Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing . 2022. View Publication
  6. Alhaddad N, Das S, Duan S, Ren L, Varia M, Xiang Z, Zhang H. Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. Cryptology ePrint Archive. 2022. View Publication
  7. Alhaddad N, Duan S, Varia M, Zhang H. Practical and Improved Byzantine Reliable Broadcast and Asynchronous Verifiable Information Dispersal from Hash Functions. Cryptology ePrint Archive. 2022. View Publication
  8. Alhaddad N, Duan S, Varia M, Zhang H . Succinct erasure coding proof systems. Cryptology ePrint Archive. 2021. View Publication
  9. Alhaddad N, Varia M, Zhang H. High-threshold avss with optimal communication complexity. Springer Berlin Heidelberg. 2021; 12675:2335-2352. View Publication

This graph shows the total number of publications by year, by first, middle/unknown, or last author.

Bar chart showing 9 publications over 4 distinct years, with a maximum of 4 publications in 2022

YearPublications
20212
20224
20242
20251

Contact for Mentoring: