Eliran Kachlon

28 papers A* 4Journal 18Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
BBQ-to-Image: Numeric Bounding Box and Qolor Control in Large-Scale Text-to-Image Models.
CoRR
Eliran Kachlon, Alexander Visheratin, Nimrod Sarid, Tal Hacham, Eyal Gutflaish, Saar Huberman, Hezi Zisman, David Ruppin, Ron Mokady
2025 J jnl
Generating an Image From 1,000 Words: Enhancing Text-to-Image With Structured Captions.
CoRR
Eyal Gutflaish, Eliran Kachlon, Hezi Zisman, Tal Hacham, Nimrod Sarid, Alexander Visheratin, Saar Huberman, Gal Davidi, Guy Bukchin, Kfir Goldberg, Ron Mokady
2025 — conf
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
CRYPTO (7)
Benny Applebaum, Eliran Kachlon
2025 J jnl
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2025 J jnl
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2025 — conf
NIZK Amplification via Leakage-Resilient Secure Computation.
CRYPTO (7)
Benny Applebaum, Eliran Kachlon
2025 J jnl
NIZK Amplification via Leakage-Resilient Secure Computation.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2024 A* conf
Conflict Checkable and Decodable Codes and Their Applications.
SODA
Benny Applebaum, Eliran Kachlon
2024 J jnl
Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2024 — conf
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.
CRYPTO (5)
Benny Applebaum, Eliran Kachlon
2024 J jnl
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2023 J jnl
Conflict Checkable and Decodable Codes and Their Applications.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2023 J jnl
Conflict Checkable and Decodable Codes and Their Applications.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2023 J jnl
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
SIAM J. Comput.
Benny Applebaum, Eliran Kachlon
2023 A* conf
The Round Complexity of Statistical MPC with Optimal Resiliency.
STOC
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 — conf
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 J jnl
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 — conf
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract).
CRYPTO (4)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2021 J jnl
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 — conf
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 A* conf
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
FOCS
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2019 J jnl
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2019 A* conf
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
FOCS
Benny Applebaum, Eliran Kachlon