Eliran Kachlon

SIAM J. Comput., December, 2023

The Round Complexity of Statistical MPC with Optimal Resiliency.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Conflict Checkable and Decodable Codes and Their Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

2022

Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders.

[BibT_eX]

[DOI]