Eliran Kachlon

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 21

Top Topics

Reachability Queries

Extended Abstract

Subgraph Mining

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC. Electron. Colloquium Comput. Complex. (2024)
Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. IACR Cryptol. ePrint Arch. 2024 (2024)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. SODA (2024)
Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. CRYPTO (5) (2024)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. SIAM J. Comput. 52 (6) (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). CRYPTO (4) (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. Electron. Colloquium Comput. Complex. 27 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). TCC (2) (2020)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Electron. Colloquium Comput. Complex. 26 (2019)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. FOCS (2019)