default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEliran Kachlon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i14]Benny Applebaum, Eliran Kachlon:
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs. Electron. Colloquium Comput. Complex. TR25 (2025)- [i13]Benny Applebaum, Eliran Kachlon:
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2025: 334 (2025) - 2024
- [c8]Benny Applebaum
, Eliran Kachlon:
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. CRYPTO (5) 2024: 286-320 - [c7]Benny Applebaum, Eliran Kachlon:
Conflict Checkable and Decodable Codes and Their Applications. SODA 2024: 1379-1424 - [i12]Benny Applebaum, Eliran Kachlon:
Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC. Electron. Colloquium Comput. Complex. TR24 (2024) - [i11]Benny Applebaum, Eliran Kachlon:
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. IACR Cryptol. ePrint Arch. 2024: 1053 (2024) - 2023
- [j1]Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. SIAM J. Comput. 52(6): 1321-1368 (2023) - [c6]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC 2023: 1527-1536 - [i10]Benny Applebaum, Eliran Kachlon:
Conflict Checkable and Decodable Codes and Their Applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i9]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. Electron. Colloquium Comput. Complex. TR23 (2023) - [i8]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2023: 418 (2023) - [i7]Benny Applebaum, Eliran Kachlon:
Conflict Checkable and Decodable Codes and Their Applications. IACR Cryptol. ePrint Arch. 2023: 627 (2023) - 2022
- [c5]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: 33-56 - [c4]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) 2022: 103-120 - [i6]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: 167 (2022) - 2021
- [i5]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. IACR Cryptol. ePrint Arch. 2021: 346 (2021) - 2020
- [c3]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS 2020: 1277-1284 - [c2]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). TCC (2) 2020: 562-594 - [i4]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. IACR Cryptol. ePrint Arch. 2020: 581 (2020) - [i2]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. IACR Cryptol. ePrint Arch. 2020: 1419 (2020)
2010 – 2019
- 2019
- [c1]Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. FOCS 2019: 171-179 - [i1]Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Electron. Colloquium Comput. Complex. TR19 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-01 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
