Zhengzhong Jin
where else to find them
what they talk about
where they keep going back
no series more than once — all 5 in the filters
on a stage with
- Abhishek Jainonce
- Giulio Malavoltaonce
- Prabhanjan Ananthonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Towards SNARGs for NP from Standard Assumptions | Proofs (Simons Institute) | 2025-07-11 |
Constructs a SNARG that, under LWE, handles any NP instance whose non‑membership has a polynomial‑size Extended Frege (propositional) proof: uses FHE of the… | ||
| Indistinguishability Obfuscation via Mathematical Proofs | Obfuscation | 2025-06-23 |
Claims a construction of iO for unbounded-input Turing machines whose equivalence is provable in Cook's Theory PV, removing the usual 2^{input-length} security… | ||
| Correlation Intractability and SNARGs from Sub-exponential DDH | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Construction of SNARGs for Batch-NP and P from the sub-exponential Decisional Diffie–Hellman assumption, achieving poly-logarithmic proof sizes and a CIH for… | ||
| Indistinguishability Obfuscation via Mathematical Proofs of Equivalence | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Claims an indistinguishability obfuscator whose security loss is independent of input length when the two programs have short formal proofs of equivalence… | ||
| Pre-Constrained Encryption | ITCS 2022 | 2022-01-31 |
Defines Pre-Constraint Encryption where an authority-generated decryption key K is limited to computing only a pre-authorized class of functions (and can… | ||
| nothing matches | ||