Ron D. Rothblum
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
- Liron Bronfmanonce
- Michael Ezraonce
who talks about the same things
- Ran Raz6 talks
- Yuval Filmus9 talks
- Guy N. Rothblum10 talks
- Dor Minzer8 talks
- Toniann Pitassi5 talks
- Yuval Ishai8 talks
| title | conference | date |
|---|---|---|
| SP1 Hypercube and the Jagged PCS | Proofs (Simons Institute) | 2025-07-11 |
SP1 Hypercube is a multilinear-based zkVM that implements a new jagged polynomial commitment to pack many opcode-specific tables into one sparse encoding… | ||
| Collision-Resistance from Multi-Collision-Resistance | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Shows a non-blackbox transformation that turns a moderately shrinking 3‑MCRH (and separately 4‑MCRH) into a collision‑resistant hash family by using the… | ||
| PCPs and Instance Compression from a Cryptographic Lens | ITCS 2022 | 2022-01-31 |
Assuming subexponential LWE, the work constructs publicly verifiable constant-query succinct PCAs for every bounded-depth NP relation by combining the JKKZ… | ||
| Small Circuits Imply Efficient Arthur-Merlin Protocols | ITCS 2022 | 2022-01-31 |
Assumes a polynomial-size DNF of parities that computes the inner product on > 5/6 accuracy and derives extremely efficient public-coin (AM/R2) protocols… | ||
| Local Proofs Approaching the Witness Length | Proofs, Consensus, and Decentralizing Society Reunion 2020 | 2020-12-04 |
Constructs constant-round IOPs for Circuit-SAT with communication arbitrarily close to the circuit size (rate → 1), constant query complexity and quasi-linear… | ||
| Efficient Multiparty Protocols via Log-Depth Threshold Formulae | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Presents a reduction that builds n‑party MPC from small‑constant MPC by player emulation: n parties are mapped into a recursive tree where each virtual player… | ||
| nothing matches | ||