Yuval Ishai
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 5 in the filters
on a stage with
- Akshayaram Srinivasanonce
- Andrej Bogdanovonce
- Avi Kaplanonce
all 13 in the filters
who talks about the same things
- Elette Boyle4 talks
- Shafi Goldwasser13 talks
- Yuval Filmus9 talks
- Yael Tauman Kalai9 talks
- Ran Canetti7 talks
- Dan Boneh10 talks
| title | conference | date |
|---|---|---|
| Secure Computation and Low-Complexity Cryptography | Secure Computation 2025 | 2025-08-04 |
Claims that semi-honest two‑party computation attains constant overhead for semi-honest 2PC by reducing general Boolean circuits to long‑string OTs and… | ||
| Computing on Encrypted Data via Secret Dual Codes | Obfuscation | 2025-06-23 |
Claim: a secret-key scheme lets a client upload an encrypted large X and issue unbounded hidden queries q with sublinear download and only a short secret key… | ||
| Locality-Preserving Hashing for Shifts with Connections to Cryptography | ITCS 2022 | 2022-01-31 |
Constructs a locality-preserving hash that reads D bits and achieves error delta ≈ 1/D^2 and proves that delta ≥ 1/D^2 via a birthday-paradox lower bound, so… | ||
| Bounded indistinguishability for simple sources | ITCS 2022 | 2022-01-31 |
Shows both positive and negative Braverman-style claims: for constant-degree/local sources constant k suffices to fool simple distinguishers, and depth‑one… | ||
| On the download rate of homomorphic secret sharing | ITCS 2022 | 2022-01-31 |
Proves optimal linear HSS for low-degree polynomials with exact rate 1 - d t / k, gives a PIR instantiation with upload cost n^{1/d} and that download rate… | ||
| Efficient Zero Knowledge Protocols: The Modular Approach | 2nd ZKProof Workshop 2019 | 2019-04-10 |
Argues for separating an information-theoretic core from the cryptographic compilation layer so design and proofs stay exact and reusable, and claims this… | ||
| Secure Multiparty Computation I | Cryptography Boot Camp 2015 | 2015-05-18 |
Covers when MPC is possible and how: information-theoretic security needs an honest majority (<k/2 corrupted) while computational security (via OT hybrid… | ||
| Secure Multiparty Computation II | Cryptography Boot Camp 2015 | 2015-05-18 |
Uses a correlated randomness dealer that gives each party additive shares of a shifted truth table (random cyclic DX,DY) so online the parties exchange only… | ||
| nothing matches | ||