Nicolas Alhaddad

According to our database¹, Nicolas Alhaddad authored at least 10 papers between 2021 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Efficient Byzantine Broadcast From Succinct Erasure Coding Proof System.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2025

2024

Committing AVID with Partial Retrieval and Optimal Storage.

[BibT_eX]

[DOI]

Nicolas Alhaddad

Leonid Reyzin

Mayank Varia

IACR Cryptol. ePrint Arch., 2024

Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications.

[BibT_eX]

[DOI]

Nicolas Alhaddad

Mayank Varia

Ziling Yang

IACR Commun. Cryptol., 2024

2022

Practical and Improved Byzantine Reliable Broadcast and Asynchronous Verifiable Information Dispersal from Hash Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Hecate: Abuse Reporting in Secure Messengers with Sealed Sender.

[BibT_eX]

[DOI]

Rawane Issa

Nicolas Alhaddad

Mayank Varia

IACR Cryptol. ePrint Arch., 2021

High-Threshold AVSS with Optimal Communication Complexity.

[BibT_eX]

[DOI]

Nicolas Alhaddad

Mayank Varia

Haibin Zhang

IACR Cryptol. ePrint Arch., 2021

Succinct Erasure Coding Proof Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Nicolas Alhaddad

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...