Eliran Kachlon

According to our database, Eliran Kachlon authored at least 16 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

BBQ-to-Image: Numeric Bounding Box and Qolor Control in Large-Scale Text-to-Image Models.

Eliran Kachlon, Alexander Visheratin, Nimrod Sarid, Tal Hacham, Eyal Gutflaish, Saar Huberman, Hezi Zisman, David Ruppin, Ron Mokady

CoRR, February, 2026

2025

Generating an Image From 1,000 Words: Enhancing Text-to-Image With Structured Captions.

Eyal Gutflaish, Eliran Kachlon, Hezi Zisman, Tal Hacham, Nimrod Sarid, Alexander Visheratin, Saar Huberman, Gal Davidi, Guy Bukchin, Kfir Goldberg, Ron Mokady

CoRR, November, 2025

How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.

Benny Applebaum, Eliran Kachlon

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

NIZK Amplification via Leakage-Resilient Secure Computation.

Benny Applebaum, Eliran Kachlon

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Conflict Checkable and Decodable Codes and Their Applications.

Benny Applebaum, Eliran Kachlon

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.

Benny Applebaum, Eliran Kachlon

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

The Round Complexity of Statistical MPC with Optimal Resiliency.

Benny Applebaum, Eliran Kachlon, Arpita Patra

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

IACR Cryptol. ePrint Arch., 2022

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

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).

Benny Applebaum, Eliran Kachlon, Arpita Patra

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

IACR Cryptol. ePrint Arch., 2021

2020

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

IACR Cryptol. ePrint Arch., 2020

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

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

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

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

Benny Applebaum, Eliran Kachlon

Electron. Colloquium Comput. Complex., 2019

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.

Benny Applebaum, Eliran Kachlon

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019