Benny Applebaum
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 6 in the filters
on a stage with
- Amos Beimelonce
- Chris Peikertonce
- Naty Peteronce
all 6 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| How to Share an NP Statement or Combiners for Zero-Knowledge Proofs | Secure Computation 2025 | 2025-08-04 |
Claims an information-theoretic construction of t-out-of-n NPSS for arbitrary t and n, built from a new MPC primitive realizable in the OT hybrid model, and… | ||
| Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Introduces a single hypothesis: prover-laconic AVP (trusted advisor gives one-time advice, verifier gets x, prover may send constant bits) requires… | ||
| Secret Sharing, Slice Formulas, and Monotone Real Circuits | ITCS 2022 | 2022-01-31 |
Proves that recent secret sharing techniques cannot achieve subexponential complexity by exhibiting a monotone P function whose schemes (and corresponding… | ||
| Panel Discussion: Computational Assumptions | Simons Institute Workshop: New Developments in Obfuscation | 2020-12-10 |
Debate-focused panel that argues specifics: who bets on PRG in NC0 versus structured assumptions like SXDH vulnerable to quantum, practical strength of LWE… | ||
| On the Assumptions Used for Obfuscation | Simons Institute Workshop: New Developments in Obfuscation | 2020-12-10 |
Survey compares four concrete assumptions used to build obfuscation: LWE, SXDH, local PRGs, and LPN. Gives concrete regimes for LPN (constant noise + linear… | ||
| Arithmetic Cryptography | The Mathematics of Modern Cryptography | 2015-07-06 |
Benny Applebaum, Tel Aviv University
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/benny-applebaum-2015-07-08 | ||
| Garbled Circuits I | Cryptography Boot Camp 2015 | 2015-05-18 |
Starts from precise definitions of garbled circuits as randomized encodings and works through simple encodings to a general template that yields Yao-style… | ||
| Garbled Circuits II | Cryptography Boot Camp 2015 | 2015-05-18 |
Benny Applebaum, Tel Aviv University
Cryptography Boot Camp
http://simons.berkeley.edu/talks/benny-applebaum-2015-05-21b | ||
| nothing matches | ||